NIST · ИТ · 7ead1b5c9dca9572b3bd
The Number of Boolean Functions with Multiplicative Complexity 2
Multiplicative complexity is a complexity measure, which is defined as the minimum number of AND gates required to implement a given primitive by a circuit over the basis (AND, XOR, NOT), with an unlimited number of NOT and XOR gates. Implementations of
NIST · ИТОфициальный источник · 2015-10-27
{
"title_en": "The Number of Boolean Functions with Multiplicative Complexity 2",
"designation": "",
"series": "",
"status": "",
"date": "2015-10-27",
"date_original": "October 27, 2015",
"url": "https://www.nist.gov/publications/number-boolean-functions-multiplicative-complexity-2",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Magnus G. Find , Daniel C. Smith-Tone , Meltem Sonmez Turan",
"abstract_excerpt_en": "Multiplicative complexity is a complexity measure, which is defined as the minimum number of AND gates required to implement a given primitive by a circuit over the basis (AND, XOR, NOT), with an unlimited number of NOT and XOR gates. Implementations of",
"id": "7ead1b5c9dca9572b3bd",
"sources": [
"NIST Publications"
],
"source_records": [
{
"title_en": "The Number of Boolean Functions with Multiplicative Complexity 2",
"designation": "",
"series": "",
"status": "",
"date": "2015-10-27",
"date_original": "October 27, 2015",
"url": "https://www.nist.gov/publications/number-boolean-functions-multiplicative-complexity-2",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Magnus G. Find , Daniel C. Smith-Tone , Meltem Sonmez Turan",
"abstract_excerpt_en": "Multiplicative complexity is a complexity measure, which is defined as the minimum number of AND gates required to implement a given primitive by a circuit over the basis (AND, XOR, NOT), with an unlimited number of NOT and XOR gates. Implementations of"
}
],
"translation_state": "none",
"possible_title_matches": 1
}