On the multiplicative complexity of some Boolean functions (Q2354498)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6458245
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the multiplicative complexity of some Boolean functions |
scientific article; zbMATH DE number 6458245 |
Statements
On the multiplicative complexity of some Boolean functions (English)
0 references
13 July 2015
0 references
Boolean function
0 references
circuit
0 references
complexity
0 references
multiplicative complexity
0 references
upper bound
0 references
0 references
0.955846905708313
0 references
0.9192652106285096
0 references
0.9038833379745485
0 references
0.8954775333404541
0 references
