Discrete & Computational Geometry

, Volume 1, Issue 4, pp 289–292

A geometric inequality and the complexity of computing volume

  • G. Elekes


The volume of the convex hull of anym points of ann-dimensional ball with volumeV is at mostV·m/2n. This implies that no polynomial time algorithm can compute the volume of a convex set (given by an oracle) with less than exponential relative error. A lower bound on the complexity of computing width can also be deduced.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [GLS]
    M. Grötschel, L. Lovász, and A. Schrijver, Geometric methods in combinatorial optimization, inProgress in Combinatorial Optimization, Vol. 1 (W. R. Pulleyblank, ed.), 167–183, Academic Press, New York, 1984.Google Scholar
  2. [L]
    L. Lovász,An Algorithmic Theory of Numbers, Graphs, and Convexity, AMS-SIAM Regional Conference Series, to appear.Google Scholar

Copyright information

© Springer-Verlag New York Inc. 1986

Authors and Affiliations

  • G. Elekes
    • 1
  1. 1.Mathematical InstituteEötvös Loránd UniversityBudapestHungary

Personalised recommendations