044e0e057ba39924f8cc · Concrete Multiplicative Complexity of Symmetric Functions

{
  "title_en": "Concrete Multiplicative Complexity of Symmetric Functions",
  "designation": "",
  "series": "",
  "status": "",
  "date": "2006-08-01",
  "date_original": "August 1, 2006",
  "url": "https://www.nist.gov/publications/concrete-multiplicative-complexity-symmetric-functions",
  "source": "NIST Publications",
  "display_en": "",
  "authors_en": "Joan Boyar, Rene Peralta",
  "abstract_excerpt_en": "The multiplicative complexity of a Boolean function f is defined as the minimum number of binary conjunction (AND) gates required to construct a circuit representing f, when only exclusive-or, conjunction and negation gates may be used. This article",
  "id": "044e0e057ba39924f8cc",
  "sources": [
    "NIST Publications"
  ],
  "source_records": [
    {
      "title_en": "Concrete Multiplicative Complexity of Symmetric Functions",
      "designation": "",
      "series": "",
      "status": "",
      "date": "2006-08-01",
      "date_original": "August 1, 2006",
      "url": "https://www.nist.gov/publications/concrete-multiplicative-complexity-symmetric-functions",
      "source": "NIST Publications",
      "display_en": "",
      "authors_en": "Joan Boyar, Rene Peralta",
      "abstract_excerpt_en": "The multiplicative complexity of a Boolean function f is defined as the minimum number of binary conjunction (AND) gates required to construct a circuit representing f, when only exclusive-or, conjunction and negation gates may be used. This article"
    }
  ],
  "translation_state": "none"
}