Pages that link to "Item:Q1198023"
From MaRDI portal
The following pages link to A note on approximate linear programming (Q1198023):
Displaying 9 items.
- Parallel approximation of min-max problems (Q354658) (← links)
- Approximating linear programming is log-space complete for P (Q750289) (← links)
- A subexponential bound for linear programming (Q1923862) (← links)
- The complexity of linear programming in \((\gamma ,\kappa )\)-form (Q2380073) (← links)
- On the space complexity of linear programming with preprocessing (Q2800577) (← links)
- Approximation Limits of Linear Programs (Beyond Hierarchies) (Q3449458) (← links)
- (Q4369264) (← links)
- An Analysis of Approximate Nonlinear Elimination (Q4874541) (← links)
- An Approximation Approach for Linear Programming in Measure Space (Q5702609) (← links)