Circuit complexity and multiplicative complexity of Boolean functions (Q3576211)
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: Circuit complexity and multiplicative complexity of Boolean functions |
scientific article; zbMATH DE number 5762752
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Circuit complexity and multiplicative complexity of Boolean functions |
scientific article; zbMATH DE number 5762752 |
Statements
Circuit Complexity and Multiplicative Complexity of Boolean Functions (English)
0 references
29 July 2010
0 references
0.8713694214820862
0 references
0.8608323335647583
0 references
0.8591499924659729
0 references
0.8458804488182068
0 references
0.8176823854446411
0 references
