Discrete & Computational Geometry

, Volume 2, Issue 4, pp 319–326

Computing the volume is difficult

Authors

  • Imre Bárány
    • Department of Operations Research and Industrial EngineeringCornell University
  • Zoltán Füredi
    • RUTCORRutgers University
Article

DOI: 10.1007/BF02187886

Cite this article as:
Bárány, I. & Füredi, Z. Discrete Comput Geom (1987) 2: 319. doi:10.1007/BF02187886

Abstract

For every polynomial time algorithm which gives an upper bound\(\overline {vol}\)(K) and a lower boundvol(K) for the volume of a convex setKR d , the ratio\(\overline {vol}\)(K)/vol(K) is at least (cd/logd) d for some convex setKR d .

Copyright information

© Springer-Verlag New York Inc. 1987