Pages that link to "Item:Q2442633"
From MaRDI portal
The following pages link to An entire space polynomial-time algorithm for linear programming (Q2442633):
Displaying 6 items.
- A wide neighborhood infeasible-interior-point method with arc-search for linear programming (Q295450) (← links)
- A linear space algorithm for the LCS problem (Q1101217) (← links)
- An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489) (← links)
- The Null Space Problem II. Algorithms (Q3783422) (← links)
- Solving tall dense linear programs in nearly linear time (Q5144963) (← links)
- A Deterministic ${\operatorname{Poly}}(\log \log N)$-Time<i>N</i>-Processor Algorithm for Linear Programming in Fixed Dimension (Q5691289) (← links)