New upper bounds on the Boolean circuit complexity of symmetric functions (Q991778)
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: New upper bounds on the Boolean circuit complexity of symmetric functions |
scientific article; zbMATH DE number 5780814
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New upper bounds on the Boolean circuit complexity of symmetric functions |
scientific article; zbMATH DE number 5780814 |
Statements
New upper bounds on the Boolean circuit complexity of symmetric functions (English)
0 references
7 September 2010
0 references
computational complexity
0 references
Boolean circuit complexity
0 references
upper bounds
0 references
symmetric functions
0 references
modular functions
0 references
0.8713825941085815
0 references
0.8678510189056396
0 references
0.8662909865379333
0 references
0.8560518622398376
0 references
0.8526906371116638
0 references
