Pages that link to "Item:Q1919805"
From MaRDI portal
The following pages link to On the complexity of solving feasible systems of linear inequalities specified with approximate data (Q1919805):
Displaying 8 items.
- A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem (Q486939) (← links)
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems (Q1274926) (← links)
- Condition measures and properties of the central trajectory of a linear program (Q1290648) (← links)
- Linear programming, complexity theory and elementary functional analysis (Q1924066) (← links)
- Improved complexity results on solving real-number linear feasibility problems (Q2490340) (← links)
- Linear one-sided approximation algorithms for the solution of overdetermined systems of linear inequalities (Q3340026) (← links)
- (Q4369264) (← links)
- On the Complexity of Solving Sparse Symmetric Linear Programs Specified with Approximate Data (Q4385160) (← links)
