Conceptintro
Trivial lower bound
Also called input-reading bound, obvious lower bound.
A bound that follows because every input item must be read, such as Omega(n) for most problems.
A bound that follows because every input item must be read, such as Omega(n) for most problems.
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 EATF60 Edit this page History Report an error