### Abstract

For every polynomial time algorithm which gives an upper bound {Mathematical expression}(K) and a lower bound vol(K) for the volume of a convex set K⊂R^{d}, the ratio {Mathematical expression}(K)/vol(K) is at least (cd/log d)^{d} for some convex set K⊂R^{d}.

Original language | English |
---|---|

Pages (from-to) | 319-326 |

Number of pages | 8 |

Journal | Discrete & Computational Geometry |

Volume | 2 |

Issue number | 1 |

DOIs | |

Publication status | Published - Dec 1 1987 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics

## Fingerprint Dive into the research topics of 'Computing the volume is difficult'. Together they form a unique fingerprint.

## Cite this

Bárány, I., & Füredi, Z. (1987). Computing the volume is difficult.

*Discrete & Computational Geometry*,*2*(1), 319-326. https://doi.org/10.1007/BF02187886