Theoremadvanced
Log-rank lower bound
Also called rank lower bound, log-rank bound.
Deterministic communication cost is at least log of the rank of the communication matrix over the reals.
Deterministic communication cost is at least log of the rank of the communication matrix over the reals.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag Y9M627 Edit this page History Report an error