On the parity complexity measures of Boolean functions (Q974756): Difference between revisions
From MaRDI portal
Latest revision as of 22:07, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the parity complexity measures of Boolean functions |
scientific article |
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