Theoremresearch
Log-rank conjecture
Also called Lovász–Saks conjecture.
Open: deterministic cost is polylogarithmic in the rank of the communication matrix.
Open: deterministic cost is polylogarithmic in the rank of the communication matrix.
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 CPV99G Edit this page History Report an error