On the parity complexity measures of Boolean functions (Q974756)
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: On the parity complexity measures of Boolean functions |
scientific article; zbMATH DE number 5717743
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the parity complexity measures of Boolean functions |
scientific article; zbMATH DE number 5717743 |
Statements
On the parity complexity measures of Boolean functions (English)
0 references
7 June 2010
0 references
computational complexity
0 references
communication complexity
0 references
parity decision tree
0 references
log-rank conjecture
0 references
0.9147658
0 references
0.91388685
0 references
0.90880775
0 references
0.9084539
0 references
0.90842974
0 references
0.90584624
0 references
0.90516025
0 references
0.90465343
0 references
