Pages that link to "Item:Q4554358"
From MaRDI portal
The following pages link to Improved Deterministic Algorithms for Linear Programming in Low Dimensions (Q4554358):
Displaying 12 items.
- An improved targeted climbing algorithm for linear programs (Q428484) (← links)
- Strict monotonicity in Todd's low-complexity algorithm for linear programming (Q1200765) (← links)
- A strictly improving linear programming Phase I algorithm (Q1312775) (← links)
- The \(\varepsilon\)-\(t\)-net problem (Q2167320) (← links)
- Improved complexity results on solving real-number linear feasibility problems (Q2490340) (← links)
- On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension (Q3837388) (← links)
- Improved Algorithms For Linear Inequalities with Two Variables Per Inequality (Q4327426) (← links)
- Solving tall dense linear programs in nearly linear time (Q5144963) (← links)
- A Deterministic Linear Program Solver in Current Matrix Multiplication Time (Q5146781) (← links)
- Low-Dimensional Linear Programming with Violations (Q5317180) (← links)
- A Deterministic ${\operatorname{Poly}}(\log \log N)$-Time<i>N</i>-Processor Algorithm for Linear Programming in Fixed Dimension (Q5691289) (← links)
- Linear programming using limited-precision oracles (Q5918922) (← links)
