Theoremresearch
Yao's lower bound for open addressing
Also called Yao's bound on open addressing.
Gives lower bounds on expected probe counts for open addressing with uniform hashing.
Gives lower bounds on expected probe counts for open addressing with uniform hashing.
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 QAX00H Edit this page History Report an error