The complexity of linear programming and other problems in the geometry of d-dimensions is studied. A notion of LP-completeness is introduced, and a set of problems is shown to be (polynomially) equivalent to linear programming. Many of these problems involve computation of subsets of convex hulls of polytopes, and require O(n log n) operations for d=2. Known results are surveyed in order to give an interesting characterization for the complexity of linear programming and a transformation is given to produce NP-complete versions of LP-complete provlems.
|Original language||English (US)|
|Number of pages||18|
|Journal||Theoretical Computer Science|
|State||Published - May 1980|
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)