Theoremcore
Span law
Law stating that running time on any number of processors is at least the span, the length of the longest dependency path.
Law stating that running time on any number of processors is at least the span, the length of the longest dependency path.
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 Y1TYRR Edit this page History Report an error