Computing the volume is difficult

For every polynomial time algorithm which gives an upper boundvol(K) and a lower boundvol(K) for the volume of a convex setK⊂Rd, the ratiovol(K)/vol(K) is at least (cd/logd)d for some convex setK⊂Rd.

[1]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

[2]  A. Macbeath An extremal property of the hypersphere , 1951, Mathematical Proceedings of the Cambridge Philosophical Society.

[3]  V. Klee,et al.  Helly's theorem and its relatives , 1963 .

[4]  R. Tichy,et al.  Stochastical approximation of convex bodies , 1985 .

[5]  György Elekes,et al.  A geometric inequality and the complexity of computing volume , 1986, Discret. Comput. Geom..

[6]  László Lovász,et al.  Algorithmic theory of numbers, graphs and convexity , 1986, CBMS-NSF regional conference series in applied mathematics.