NIST · ИТ · f6e3a63fa44342ba9d3e
Tight Bounds for the Multiplicative Complexity of Symmetric Functions
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
NIST · ИТОфициальный источник · 2008-04-28
{
"title_en": "Tight Bounds for the Multiplicative Complexity of Symmetric Functions",
"designation": "",
"series": "",
"status": "",
"date": "2008-04-28",
"date_original": "April 28, 2008",
"url": "https://www.nist.gov/publications/tight-bounds-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": "f6e3a63fa44342ba9d3e",
"sources": [
"NIST Publications"
],
"source_records": [
{
"title_en": "Tight Bounds for the Multiplicative Complexity of Symmetric Functions",
"designation": "",
"series": "",
"status": "",
"date": "2008-04-28",
"date_original": "April 28, 2008",
"url": "https://www.nist.gov/publications/tight-bounds-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",
"possible_title_matches": 1
}