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

NIST · ИТ · 17f61233abe824a844e5

17f61233abe824a844e5 · Conference Paper

A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit Function

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

Полные импортированные сведения карточки
{
  "title_en": "A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit Function",
  "designation": "Conference Paper",
  "series": "Conference Paper",
  "status": "Final",
  "date": "2016-10-11",
  "date_original": "10/11/2016",
  "url": "https://csrc.nist.gov/pubs/conference/2016/10/11/betterthan3n-lower-bound-circuit-complexity-explic/final",
  "source": "CSRC",
  "display_en": "Conference Paper (Final)",
  "authors_en": "",
  "abstract_excerpt_en": "",
  "id": "17f61233abe824a844e5",
  "sources": [
    "CSRC"
  ],
  "source_records": [
    {
      "title_en": "A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit Function",
      "designation": "Conference Paper",
      "series": "Conference Paper",
      "status": "Final",
      "date": "2016-10-11",
      "date_original": "10/11/2016",
      "url": "https://csrc.nist.gov/pubs/conference/2016/10/11/betterthan3n-lower-bound-circuit-complexity-explic/final",
      "source": "CSRC",
      "display_en": "Conference Paper (Final)",
      "authors_en": "",
      "abstract_excerpt_en": ""
    }
  ],
  "translation_state": "none"
}