Near-Optimal Parallel Approximate Counting via Sampling
Open Access
- 6 July 2026
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 550-559
Abstract
No abstract availableAll Related Versions
This publication has 15 references indexed in Scilit:
- Optimal mixing for two-state anti-ferromagnetic spin systems2022
- The Computational Hardness of Counting in Two-Spin Models on d-Regular Graphs2012
- Using TPA for Bayesian Inference*2011
- Adaptive simulated annealing: A near-optimal connection between sampling and countingJournal of the ACM, 2009
- Accelerating Simulated Annealing for the Permanent and Combinatorial Counting ProblemsSIAM Journal on Computing, 2008
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entriesJournal of the ACM, 2004
- Polynomial-Time Approximation Algorithms for the Ising ModelSIAM Journal on Computing, 1993
- A random polynomial-time algorithm for approximating the volume of convex bodiesJournal of the ACM, 1991
- Approximating the PermanentSIAM Journal on Computing, 1989
- Random generation of combinatorial structures from a uniform distributionTheoretical Computer Science, 1986