A random polynomial-time algorithm for approximating the volume of convex bodies
- 3 January 1991
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 38 (1), 1-17
- https://doi.org/10.1145/102782.102783
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Approximate counting, uniform generation and rapidly mixing Markov chainsInformation and Computation, 1989
- On the Complexity of Computing the Volume of a PolyhedronSIAM Journal on Computing, 1988
- Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolvedPublished by Association for Computing Machinery (ACM) ,1988
- A geometric inequality and the complexity of computing volumeDiscrete & Computational Geometry, 1986
- Computing the volume is difficultPublished by Association for Computing Machinery (ACM) ,1986
- How hard is it to marry at random? (On the approximation of the permanent)Published by Association for Computing Machinery (ACM) ,1986
- Sur une in galit isop rim trique qui g n ralise celle de Paul L vy-GromovInventiones Mathematicae, 1985
- Monte-Carlo algorithms for enumeration and reliability problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963