Sciweavers

Share
STOC
1989
ACM

A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies

11 years 5 months ago
A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies
We present a randomised polynomial time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space. The proof of correctness of the algorithm relies on recent theory of rapidly mixing Markov chains and isoperimetric inequalities to show that a certain random walk can be used to sample nearly uniformly from within K.
Martin E. Dyer, Alan M. Frieze, Ravi Kannan
Added 11 Aug 2010
Updated 11 Aug 2010
Type Conference
Year 1989
Where STOC
Authors Martin E. Dyer, Alan M. Frieze, Ravi Kannan
Comments (0)
books