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.
|Number of pages||10|
|Journal||Annual Symposium on Foundations of Computer Science - Proceedings|
|Publication status||Published - Dec 2 2003|
|Event||Proceedings: 44th Annual IEEE Symposium on Foundations of Computer Science - FOCS 2003 - Cambridge, MA, United States|
Duration: Oct 11 2003 → Oct 14 2003
ASJC Scopus subject areas
- Hardware and Architecture