Techniqueresearch
Randomized linking
Also called random linking, randomized union.
Linking roots by random priorities, giving the same bounds as union by rank in expectation.
Linking roots by random priorities, giving the same bounds as union by rank in expectation.
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 TD808H Edit this page History Report an error