2026
CLM-LR-DRAFT-ALG-12-1<= O(nm)ASYMPTOTIC BOUNDOn a routing problemEvidence quality: PAPER · Source: Bellman-Ford shortest-path complexity ↗
SOURCE CONFIRMED
Limits RegistryPUBLIC RECORDLimits RegistryPUBLIC RECORDLimits RegistryPUBLIC RECORDLimits RegistryA scoped, source-linked candidate record for bellman-ford shortest-path complexity.
The question, scope, and sources behind this Registry record.
Determine the stated frontier for Bellman-Ford shortest-path complexity.
Change a parameter to stress-test whether a proposed result is still inside the published specification. This is an audit aid, not a proof checker.
Current frontiers derived from accepted Claims.
The frontier is not sacred
Most progress starts with a disagreement that survives contact with evidence. If you can push the known lower bound up or pull the upper bound down, show us the work.
≥ when you have shown that at least this value is achievable.≤ when you have shown that anything above this value is impossible.No vibes. State the value, define the scope, and link the paper, proof, code, or reproduction that lets another person check it. Editors review every challenge before the public record changes.
Challenge this recordAssertions tied to evidence, attribution, and review.
The frontier as it changed over time.
Only accepted Claims matching the current specification contribute to the displayed bounds. Strict inequalities remain open; contradictory Claims require editorial review.
No accepted machine-checked reproductions are recorded for this Limit.
Limits Registry. LR-DRAFT-ALG-12. Bellman-Ford shortest-path complexity. 2026.