On the complexity of some basic problems in computational convexity: I. Containment problems
- 31 December 1994
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 136 (1-3), 129-174
- https://doi.org/10.1016/0012-365x(94)00111-u
Abstract
No abstract availableKeywords
This publication has 83 references indexed in Scilit:
- Product range spaces, sensitive sampling, and derandomizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Diameter, width, closest line pair, and parametric searchingDiscrete & Computational Geometry, 1993
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedraDiscrete & Computational Geometry, 1992
- A PARALLEL ALGORITHM FOR ENCLOSED AND ENCLOSING TRIANGLESInternational Journal of Computational Geometry & Applications, 1992
- Robust linear programming discrimination of two linearly inseparable setsOptimization Methods and Software, 1992
- A complete description of the traveling salesman polytope on 8 nodesOperations Research Letters, 1991
- Computational complexity of norm-maximizationCombinatorica, 1990
- Computing the volume is difficultDiscrete & Computational Geometry, 1987
- The complexity of elementary algebra and geometryJournal of Computer and System Sciences, 1986
- The Hadamard Maximum Determinant ProblemThe American Mathematical Monthly, 1972