Computing the volume is difficult

Imre Bárány, Zoltán Füredi

Research output: Contribution to journalArticle

81 Citations (Scopus)

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⊂Rd, the ratio {Mathematical expression}(K)/vol(K) is at least (cd/log d)d for some convex set K⊂Rd.

Original languageEnglish
Pages (from-to)319-326
Number of pages8
JournalDiscrete & Computational Geometry
Volume2
Issue number1
DOIs
Publication statusPublished - 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