Solving Linear Programs in the Matrix Multiplication Time
cs.DS
Submitted: 2026-11-05
Updated: 2026-11-05
Terminology
Sources
- Multiplying matrices via polynomials: exposition and barriers
- Minimum Cost Flows, MDPs, and $\ell_1$-Regression in Nearly Linear Time for Dense Instances
- Low Rank Approximation and Regression in Input Sparsity Time
- Kadison--Singer in Deterministic Polynomial Time
- Powers of Tensors and Fast Matrix Multiplication
- Path Finding I :Solving Linear Programs with \~O(sqrt(rank)) Linear System Solves
- Solving Linear Programs with Sqrt(rank) Linear System Solves
- OSNAP: Faster numerical linear algebra algorithms via sparser subspace embeddings
- Matrix Multiplication from Polynomial Packings: A Constructive and Elementary Proof of omega 9/4
- Sketching as a Tool for Numerical Linear Algebra
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