Pages that link to "Item:Q5904560"
From MaRDI portal
The following pages link to The complexity of linear programming (Q5904560):
Displaying 11 items.
- On the complexity of d-dimensional Voronoi diagrams (Q599355) (← links)
- Approximating linear programming is log-space complete for P (Q750289) (← links)
- Computing circular separability (Q1079817) (← links)
- Nonlinear mixing dynamical systems (Q1111747) (← links)
- Learning in parallel (Q1187024) (← links)
- Rational search (Q1252036) (← links)
- Linear programming is log-space hard for P (Q1255780) (← links)
- Algorithms and complexity analysis for some flow problems (Q1317482) (← links)
- Men and progress in linear programming (Q3089104) (← links)
- Filling polyhedral molds (Q5060114) (← links)
- Foundations of operations research: from linear programming to data envelopment analysis (Q6106760) (← links)
