00cb9f670dae26e92137 · Multiplicative Complexity of Vector Value Boolean Functions

{
  "title_en": "Multiplicative Complexity of Vector Value Boolean Functions",
  "designation": "",
  "series": "",
  "status": "",
  "date": "2015-09-21",
  "date_original": "September 21, 2015",
  "url": "https://www.nist.gov/publications/multiplicative-complexity-vector-value-boolean-functions",
  "source": "NIST Publications",
  "display_en": "",
  "authors_en": "Magnus G. Find , Joan Boyar",
  "abstract_excerpt_en": "We consider the multiplicative complexity of Boolean functions with multiple bits of output, studying how large a multiplicative complexity is necessary and sufficient to provide a desired nonlinearity. For so-called $\\Sigma\\Pi\\Sigma$ circuits, we show",
  "id": "00cb9f670dae26e92137",
  "sources": [
    "NIST Publications"
  ],
  "source_records": [
    {
      "title_en": "Multiplicative Complexity of Vector Value Boolean Functions",
      "designation": "",
      "series": "",
      "status": "",
      "date": "2015-09-21",
      "date_original": "September 21, 2015",
      "url": "https://www.nist.gov/publications/multiplicative-complexity-vector-value-boolean-functions",
      "source": "NIST Publications",
      "display_en": "",
      "authors_en": "Magnus G. Find , Joan Boyar",
      "abstract_excerpt_en": "We consider the multiplicative complexity of Boolean functions with multiple bits of output, studying how large a multiplicative complexity is necessary and sufficient to provide a desired nonlinearity. For so-called $\\Sigma\\Pi\\Sigma$ circuits, we show"
    }
  ],
  "translation_state": "none",
  "possible_title_matches": 1
}