Theoremresearch
Chazelle-Liu lower bound for fractional cascading
Also called Chazelle-Liu lower bound.
Lower bounds on space and query time for intersection searching and fractional cascading in higher dimensions, showing the savings cannot be unbounded.
Lower bounds on space and query time for intersection searching and fractional cascading in higher dimensions, showing the savings cannot be unbounded.
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 PNZ7QC Edit this page History Report an error