A geometric inequality and the complexity of computing volume

Abstract

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.

References

  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.

Download references

Author information

Affiliations

Authors

Additional information

Dedicated to my teacher Kõváry Károly

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Elekes, G. A geometric inequality and the complexity of computing volume. Discrete Comput Geom 1, 289–292 (1986). https://doi.org/10.1007/BF02187701

Download citation

Keywords

  • Polynomial Time
  • Convex Hull
  • Convex Body
  • Polynomial Time Algorithm
  • Discrete Comput Geom