Theoremresearch
Fredman-Saks lower bound
Also called cell-probe lower bound for union-find.
In the cell-probe model, union-find requires amortized Omega(alpha(n)) time per operation, so Tarjan's bound is tight.
In the cell-probe model, union-find requires amortized Omega(alpha(n)) time per operation, so Tarjan's bound is tight.
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 H94MFN Edit this page History Report an error