An Optimal Algorithm for Monte Carlo Estimation
- 1 January 2000
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 29 (5), 1484-1496
- https://doi.org/10.1137/s0097539797315306
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- An Optimal Algorithm for Monte Carlo EstimationSIAM Journal on Computing, 2000
- An optimal approximation algorithm for Bayesian inferenceArtificial Intelligence, 1997
- An analysis of a Monte Carlo algorithm for estimating the permanentCombinatorica, 1995
- Lower bounds for sampling algorithms for estimating the averageInformation Processing Letters, 1995
- Polynomial-Time Approximation Algorithms for the Ising ModelSIAM Journal on Computing, 1993
- A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack ProblemCombinatorics, Probability and Computing, 1993
- A Monte-Carlo Algorithm for Estimating the PermanentSIAM Journal on Computing, 1993
- Approximating the permanent of graphs with large factorsTheoretical Computer Science, 1992
- A random polynomial-time algorithm for approximating the volume of convex bodiesJournal of the ACM, 1991
- Random generation of combinatorial structures from a uniform distributionTheoretical Computer Science, 1986