New upper bounds on the Boolean circuit complexity of symmetric functions (Q991778)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New upper bounds on the Boolean circuit complexity of symmetric functions |
scientific article |
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
