Simulated annealing in convex bodies and an O* (n4) volume algorithm

László Lovász, Santosh Vempala

Research output: Contribution to journalConference article

20 Citations (Scopus)

Abstract

We present a new algorithm for computing the volume of a convex body in ℝn. The main ingredient of the algorithm is a "morphing" technique that can be viewed as a variant of simulated annealing. Its complexity is O* (n4), improving on the previous best algorithm by a factor of n.

Original languageEnglish
Pages (from-to)650-659
Number of pages10
JournalAnnual Symposium on Foundations of Computer Science - Proceedings
Publication statusPublished - Dec 2 2003
EventProceedings: 44th Annual IEEE Symposium on Foundations of Computer Science - FOCS 2003 - Cambridge, MA, United States
Duration: Oct 11 2003Oct 14 2003

    Fingerprint

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this