A random polynomial-time algorithm for approximating the volume of convex bodies
Data up to Jan 2025
Total Citations Per Year
Abstract
References (17)
An introduction to probability theory and its applications
1958 • 31,109 citations
Elliptic Partial Differential Equations of Second Order
2001 • 19,324 citations
Probability Inequalities for sums of Bounded Random Variables
1994 • 7,059 citations
Probability Inequalities for Sums of Bounded Random Variables
1963 • 4,356 citations
Random generation of combinatorial structures from a uniform distribution
1986 • 1,025 citations
Asymptotic Theory of Finite Dimensional Normed Spaces
1986 • 846 citations
Approximate counting, uniform generation and rapidly mixing Markov chains
1989 • 757 citations
Random walks on finite groups and rapidly mixing markov chains
1983 • 478 citations
An Algorithmic Theory of Numbers, Graphs and Convexity
1986 • 369 citations
Monte-Carlo algorithms for enumeration and reliability problems
1983 • 314 citations
On the Complexity of Computing the Volume of a Polyhedron
1988 • 311 citations
Random generation of combinatorial structures from a uniform
1986 • 284 citations
Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved
1988 • 205 citations
How hard is it to marry at random? (On the approximation of the permanent)
1986 • 156 citations
A geometric inequality and the complexity of computing volume
1986 • 120 citations
Sur une in�galit� isop�rim�trique qui g�n�ralise celle de Paul L�vy-Gromov
1985 • 66 citations
Computing the volume is difficult
1986 • 57 citations