Multiplicative complexity of vector valued Boolean functions (Q1704580)
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: Multiplicative complexity of vector valued Boolean functions |
scientific article; zbMATH DE number 6849011
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multiplicative complexity of vector valued Boolean functions |
scientific article; zbMATH DE number 6849011 |
Statements
Multiplicative complexity of vector valued Boolean functions (English)
0 references
12 March 2018
0 references
multiplicative complexity
0 references
nonlinearity
0 references
circuits
0 references
error correcting codes
0 references
0 references
0 references
0 references
0 references
0.9331204295158386
0 references
0.8572507500648499
0 references
0.8535456657409668
0 references
0.8447994589805603
0 references
0.8418208956718445
0 references
