Faster Deterministic All-Pairs Shortest Paths with Real Edge Weights
cs.DS
Submitted: 2026-11-12
Updated: 2026-11-15
Code: https://github.com/shreshth-s/thin-matrix-results
Terminology
Sources
- 3SUM Made Simpler (Without Matrix Multiplication), k-SUM Hypothesis Refuted for Odd k, and Real 3SUM/APSP Derandomized
- Hardness for Triangle Problems under Even More Believable Hypotheses: Reductions from Real APSP, Real 3SUM, and OV
- Improved Rectangular Matrix Multiplication using Powers of the Coppersmith-Winograd Tensor
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time