loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
44th Annual IEEE Symposium on Foundations of Computer Science (FOCS'03)
Simulated Annealing in Convex Bodies and an 0*(n4) Volume Algorithm
Cambridge, Massachusettes
October 11-October 14
ISBN: 0-7695-2040-5
László Lovász, Microsoft Research
Santosh Vempala, Massachusetts Institute of Technology
We present a new algorithm for computing the volume of a convex body in \mathbb{R}^n. The main ingredient of the algorithm is a "morphing" technique that can be viewed as a variant of simulated annealing. Its complexity is 0*(n4), improving on the previous best algorithm by a factor of n.
Citation:
László Lovász, Santosh Vempala, "Simulated Annealing in Convex Bodies and an 0*(n4) Volume Algorithm," focs, pp.650, 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.