A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Fine-grained reductions from approximate counting to decision
2018
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018
In this paper, we introduce a general framework for fine-grained reductions of approximate counting problems to their decision versions. (Thus we use an oracle that decides whether any witness exists to multiplicatively approximate the number of witnesses with minimal overhead.) This mirrors a foundational result of Sipser (STOC 1983) and Stockmeyer (SICOMP 1985) in the polynomial-time setting, and a similar result of Müller (IWPEC 2006) in the FPT setting. Using our framework, we obtain such
doi:10.1145/3188745.3188920
dblp:conf/stoc/DellL18
fatcat:gzozgnb4ejexzioaivewqmxggm