The complexity of linear programming
- 1 June 1981
- journal article
- Published by Wiley in Statistica Neerlandica
- Vol. 35 (2) , 91-107
- https://doi.org/10.1111/j.1467-9574.1981.tb00717.x
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Worst case behavior of the steepest edge simplex methodDiscrete Applied Mathematics, 1979
- Linear programming is log-space hard for PInformation Processing Letters, 1979
- Efficient search for rationalsInformation Processing Letters, 1979
- On the Structure of Polynomial Time ReducibilityJournal of the ACM, 1975
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Zufällige konvexe Polyeder imN-dimensionalen euklidischen RaumPeriodica Mathematica Hungarica, 1972
- How to Solve Linear InequalitiesThe American Mathematical Monthly, 1969
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965
- The Relaxation Method for Linear InequalitiesCanadian Journal of Mathematics, 1954
- The Relaxation Method for Linear InequalitiesCanadian Journal of Mathematics, 1954