Theoremcore
Universal hashing expected chain length
Also called universal hashing theorem.
With a universal family and chaining, expected unsuccessful search is O(1+alpha).
With a universal family and chaining, expected unsuccessful search is O(1+alpha).
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 V6RF8F Edit this page History Report an error