Techniqueresearch
Corruption bound
Also called Yao's corruption bound.
Lower bound for randomized communication via rectangles that are mostly monochromatic.
Lower bound for randomized communication via rectangles that are mostly monochromatic.
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 KJ06DP Edit this page History Report an error