code · pending
Artifact ↗Source authenticated
Complexity of Terminal-Only Manhattan Prim-Dijkstra Routing
Prim-Dijkstra routing interpolates between a minimum spanning tree and a shortest-path tree, and has been used and improved in VLSI physical design since the early 1990s, but the complexity of the terminal-only Manhattan decision problem was never settled. It is weakly NP-complete. A continuous cost-radius tradeoff with a balanced $(2,2)$ guarantee accompanies the classification.
Exact FrontierDelta
Prior state unknown→proved
Scope and record
Occurred: Jul 18, 2026
Delta type: SOURCE CLAIM
Assumptions: VibeMathed verification: unreviewed. Publication: preprint. AI contribution: ai-discovered. Imported under CC BY 4.0.
Canonical aliases: Complexity of Terminal-Only Manhattan Prim-Dijkstra Routing · Prim-Dijkstra complexity
Confidence: Not scored
Registry verification: unreviewed · preprint · resolved
Attribution
VibeMathed
registry · event recorded by
Keren Zhu
human · human collaborator
GPT-5.6 Sol in Codex
model · ai model contributor · OpenAI
Artifacts and verifiers
Compute record
No linked compute attempts recorded.
Lineage and corrections
This event attributed to Keren Zhu
This event attributed to GPT-5.6 Sol in Codex