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 3 items.
- A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem (Q486939) (← 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)
