By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Lovasz, L. ; Microsoft Res., Redmond, WA, USA ; Vempala, S.

We present a new algorithm for computing the volume of a convex body in Rn. 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.

Published in:

Foundations of Computer Science, 2003. Proceedings. 44th Annual IEEE Symposium on

Date of Conference:

11-14 Oct. 2003