A reusable enumerate-or-sample framework turns recursion-tree upper bounds into O*(sqrt(b))-time approximate counters, improving bases for five counting problems.
Approximate counting, uniform generation and rapidly mixing Markov chains.Information and Computation, 82(1):93–133, 1989
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Faster Exponential-Time Approximate Counting via Bounded Self-Reductions
A reusable enumerate-or-sample framework turns recursion-tree upper bounds into O*(sqrt(b))-time approximate counters, improving bases for five counting problems.