log-rank conjecture
E1997115
UNEXPLORED
The log-rank conjecture is a central open problem in communication complexity that posits a polynomial relationship between the deterministic communication complexity of a Boolean function and the logarithm of the rank of its associated communication matrix.
All labels observed (1)
| Label | Occurrences |
|---|---|
| log-rank conjecture canonical | 1 |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.