Multiplicative complexity of some Boolean functions (Q314127)
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 6626595
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multiplicative complexity of some Boolean functions |
scientific article; zbMATH DE number 6626595 |
Statements
Multiplicative complexity of some Boolean functions (English)
0 references
13 September 2016
0 references
Boolean function
0 references
circuit
0 references
complexity
0 references
multiplicative (conjunctive) complexity
0 references
upper bound
0 references
0.98417425
0 references
0.9811322
0 references
0.96114755
0 references
0.9530459
0 references
0.9433337
0 references
0.94029415
0 references
0.9268042
0 references
