The multiplicative complexity of 6-variable Boolean functions (Q1755188)
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 6998172
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The multiplicative complexity of 6-variable Boolean functions |
scientific article; zbMATH DE number 6998172 |
Statements
The multiplicative complexity of 6-variable Boolean functions (English)
0 references
8 January 2019
0 references
affine equivalence
0 references
Boolean functions
0 references
circuit complexity
0 references
cryptography
0 references
multiplicative complexity
0 references
0 references
0.8805317282676697
0 references
0.8761786222457886
0 references
0.8721238970756531
0 references
0.868399441242218
0 references
0.8613251447677612
0 references
