The complexity of linear programming
David Dobkin, Steven P. Reiss · Theoretical Computer Science · 1980
Cited by 63 works. doi:10.1016/0304-3975(80)90031-6
Authors
References
- Pattern classification and scene analysis
- Reducibility among Combinatorial Problems
- Linear Programming and Extensions
- Complexity of Computer Computations
- Pattern Classification and Scene Analysis.
- An efficient algorith for determining the convex hull of a finite planar set
- Closest-point problems
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Some simplified NP-complete graph problems
- Geometric complexity