On the multiplicative complexity of Boolean functions (Q4976406)
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 6754670
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the multiplicative complexity of Boolean functions |
scientific article; zbMATH DE number 6754670 |
Statements
On the Multiplicative Complexity of Boolean Functions (English)
0 references
28 July 2017
0 references
Boolean function
0 references
circuit
0 references
complexity
0 references
multiplicative complexity
0 references
upper bound
0 references
0.9353748559951782
0 references
0.925871193408966
0 references
0.9192652106285096
0 references
0.8779274821281433
0 references
0.8687942028045654
0 references
