Nearly optimal separations between communication (or query) complexity and partitions (Q5368738)
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 6789269
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nearly optimal separations between communication (or query) complexity and partitions |
scientific article; zbMATH DE number 6789269 |
Statements
10 October 2017
0 references
query complexity
0 references
communication complexity
0 references
subcube partition complexity
0 references
partition bound
0 references
0.8188369870185852
0 references
0.7773025631904602
0 references
