Parity decision tree complexity and 4-party communication complexity of XOR-functions are polynomially equivalent (Q2825306)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6635876
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parity decision tree complexity and 4-party communication complexity of XOR-functions are polynomially equivalent |
scientific article; zbMATH DE number 6635876 |
Statements
7 October 2016
0 references
parity decision tree complexity
0 references
communication complexity
0 references
XOR functions
0 references
log-rank conjecture
0 references
Parity decision tree complexity and 4-party communication complexity of XOR-functions are polynomially equivalent (English)
0 references
0.8317279815673828
0 references
0.8037890195846558
0 references
0.7674004435539246
0 references
0.76264888048172
0 references
0.7593270540237427
0 references
