Conceptadvanced
All-Pairs Shortest Paths conjecture
Also called APSP hypothesis, APSP conjecture.
Conjecture that APSP on n-vertex graphs cannot be solved in time n^(3-epsilon) for any epsilon > 0.
Conjecture that APSP on n-vertex graphs cannot be solved in time n^(3-epsilon) for any epsilon > 0.
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 NDJDBF Edit this page History Report an error