Theoremadvanced
Convex hull lower bound
Also called Omega(n log n) convex hull bound, Omega(n log n) lower bound for convex hull.
Computing the convex hull requires Omega(n log n) in the algebraic decision tree model, by reduction from sorting.
Computing the convex hull requires Omega(n log n) in the algebraic decision tree model, by reduction from sorting.
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 T6J9NW Edit this page History Report an error