Conceptintro
Critical path lower bound
Also called longest chain bound.
The longest precedence chain is a lower bound on the makespan.
The longest precedence chain is a lower bound on the makespan.
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 NX7HGC Edit this page History Report an error