Solving tall dense linear programs in nearly linear time
From MaRDI portal
Publication:5144963
Recommendations
- Solving Large Batches of Linear Programs
- scientific article; zbMATH DE number 724217
- An entire space polynomial-time algorithm for linear programming
- Solving linear programs in the current matrix multiplication time
- Solving Linear Programs in the Current Matrix Multiplication Time
- Solving related two- and three-dimensional linear programming problems in logarithmic time
- A Deterministic Linear Program Solver in Current Matrix Multiplication Time
- Improved deterministic algorithms for linear programming in low dimensions
- Improved deterministic algorithms for linear programming in low dimensions
Cited in
(14)- Solving related two- and three-dimensional linear programming problems in logarithmic time
- Minimum power partial multi-cover on a line
- Solving Linear Programs in the Current Matrix Multiplication Time
- Unit Capacity Maxflow in Almost $m^{4/3}$ Time
- A Deterministic Linear Program Solver in Current Matrix Multiplication Time
- A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
- Solving Tall Dense Linear Programs in Nearly Linear Time
- Quantum speedups for linear programming via interior point methods
- The bit complexity of dynamic algebraic formulas and their determinants
- Training multi-layer over-parametrized neural network in subquadratic time
- Interior point methods are not worse than simplex
- Nested dissection meets IPMs: planar min-cost flow in nearly-linear time
- Negative-weight single-source shortest paths in near-linear time
- Maximum flow and minimum-cost flow in almost-linear time
This page was built for publication: Solving tall dense linear programs in nearly linear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5144963)
