On the multiplicative complexity of quasi-quadratic Boolean functions (Q2356508)
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 6467816
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the multiplicative complexity of quasi-quadratic Boolean functions |
scientific article; zbMATH DE number 6467816 |
Statements
On the multiplicative complexity of quasi-quadratic Boolean functions (English)
0 references
30 July 2015
0 references
Boolean function
0 references
quadratic function
0 references
quasi-quadratic function
0 references
Zhegalkin polynomial
0 references
multiplicative complexity
0 references
upper bound
0 references
lower bound
0 references
0 references
0.8954775333404541
0 references
0.8841142654418945
0 references
0.8751034736633301
0 references
0.8720917701721191
0 references
