The complexity of linear programming
Open Access
- 31 May 1980
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 11 (1), 1-18
- https://doi.org/10.1016/0304-3975(80)90031-6
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Linear programming is log-space hard for PInformation Processing Letters, 1979
- A lower bound of 12n2 on linear search programs for the Knapsack problemJournal of Computer and System Sciences, 1978
- Multidimensional Searching ProblemsSIAM Journal on Computing, 1976
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976
- Generating All the Faces of a PolyhedronSIAM Journal on Applied Mathematics, 1974
- An efficient algorith for determining the convex hull of a finite planar setInformation Processing Letters, 1972
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- An Algorithm for Convex PolytopesJournal of the ACM, 1970
- On The Number of Faces of a Convex PolytopeCanadian Journal of Mathematics, 1964
- An Algorithm for Finding All Vertices of Convex Polyhedral SetsJournal of the Society for Industrial and Applied Mathematics, 1961