Theoremresearch
Fredman-Saks lower bound for partial sums
Also called Fredman-Saks cell-probe lower bound, partial sums lower bound.
In the cell-probe model, any dynamic partial-sums structure needs Omega(log n / log log n) time per operation.
In the cell-probe model, any dynamic partial-sums structure needs Omega(log n / log log n) time per operation.
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 YG3XV5 Edit this page History Report an error