The multiplicative complexity of Boolean functions on four and five variables (Q2946971)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The multiplicative complexity of Boolean functions on four and five variables |
scientific article; zbMATH DE number 6483502
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The multiplicative complexity of Boolean functions on four and five variables |
scientific article; zbMATH DE number 6483502 |
Statements
The Multiplicative Complexity of Boolean Functions on Four and Five Variables (English)
0 references
18 September 2015
0 references
affine transformation
0 references
Boolean functions
0 references
circuit complexity
0 references
multiplicative complexity
0 references
0 references
0.8456073999404907
0 references
0.833524763584137
0 references
0.8251987099647522
0 references
0.8184464573860168
0 references
0.8123671412467957
0 references
