An additive combinatorics approach relating rank to communication complexity (Q5501927)
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 6472744
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An additive combinatorics approach relating rank to communication complexity |
scientific article; zbMATH DE number 6472744 |
Statements
An Additive Combinatorics Approach Relating Rank to Communication Complexity (English)
0 references
14 August 2015
0 references
communication complexity
0 references
additive combinatorics
0 references
approximate duality
0 references
log-rank conjecture
0 references
low-rank matrices
0 references
polynomial Freiman-Ruzsa conjecture
0 references
0 references
0 references
0 references
0.800864040851593
0 references
0.7840945720672607
0 references
0.7829613089561462
0 references
