Smallest formulas for the parity of \(2^k\) variables are essentially unique (Q974758)
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: Smallest formulas for the parity of 2ᵏ variables are essentially unique |
scientific article; zbMATH DE number 5717745
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Smallest formulas for the parity of \(2^k\) variables are essentially unique |
scientific article; zbMATH DE number 5717745 |
Statements
Smallest formulas for the parity of \(2^k\) variables are essentially unique (English)
0 references
7 June 2010
0 references
combinatorial complexity
0 references
uniqueness of optimal algorithms
0 references
formula complexity
0 references
Karchmer-Wigderson protocol
0 references
communication complexity
0 references
0.9957639575004578
0 references
0.741477370262146
0 references
0.7306100130081177
0 references
0.717056393623352
0 references
0.7134791016578674
0 references
