Pages that link to "Item:Q623362"
From MaRDI portal
The following pages link to Smoothed analysis of condition numbers and complexity implications for linear programming (Q623362):
Displaying 12 items.
- Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q384506) (← links)
- Robust smoothed analysis of a condition number for linear programming (Q662310) (← links)
- Probabilistic analysis of condition numbers for linear programming (Q700762) (← links)
- Smoothed analysis of integer programming (Q877191) (← links)
- Coverage processes on spheres and condition numbers for linear programming (Q964778) (← links)
- On the complexity of linear programming under finite precision arithmetic (Q1380938) (← links)
- Smoothed analysis of termination of linear programming algorithms (Q1403294) (← links)
- Solving linear programs with finite precision. I: Condition numbers and random programs (Q1424293) (← links)
- Smooth analysis of the condition number and the least singular value (Q3160742) (← links)
- Smoothed Analysis of Local Search Algorithms (Q3449848) (← links)
- Smoothed analysis of algorithms (Q3583576) (← links)
- Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems (Q5930724) (← links)