⌕ Поиск по атласу

NIST · ИТ · 0d96d61d0d648b4e66da

0d96d61d0d648b4e66da · Conference Paper

New Bounds on the Multiplicative Complexity of Boolean Functions

Официальный источник · 2022-09-11

Полные импортированные сведения карточки
{
  "title_en": "New Bounds on the Multiplicative Complexity of Boolean Functions",
  "designation": "Conference Paper",
  "series": "Conference Paper",
  "status": "Final",
  "date": "2022-09-11",
  "date_original": "9/11/2022",
  "url": "https://csrc.nist.gov/pubs/conference/2022/09/11/new-bounds-on-the-multiplicative-complexity-of-boo/final",
  "source": "CSRC",
  "display_en": "Conference Paper (Final)",
  "authors_en": "",
  "abstract_excerpt_en": "",
  "id": "0d96d61d0d648b4e66da",
  "sources": [
    "CSRC"
  ],
  "source_records": [
    {
      "title_en": "New Bounds on the Multiplicative Complexity of Boolean Functions",
      "designation": "Conference Paper",
      "series": "Conference Paper",
      "status": "Final",
      "date": "2022-09-11",
      "date_original": "9/11/2022",
      "url": "https://csrc.nist.gov/pubs/conference/2022/09/11/new-bounds-on-the-multiplicative-complexity-of-boo/final",
      "source": "CSRC",
      "display_en": "Conference Paper (Final)",
      "authors_en": "",
      "abstract_excerpt_en": ""
    }
  ],
  "translation_state": "none"
}