Techniqueintro
Decision tree lower bound method
Also called comparison tree lower bound, decision tree argument.
Bounds the worst-case cost of comparison algorithms by the depth of any decision tree that solves the problem.
Bounds the worst-case cost of comparison algorithms by the depth of any decision tree that solves the problem.
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 HPJEPD Edit this page History Report an error