## Fine-Grained Reductions from Approximate Counting to Decision

Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review

#### Standard

**Fine-Grained Reductions from Approximate Counting to Decision.** / Dell, Holger; Lapinskas, John.

Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review

#### Harvard

*ACM Transactions on Computation Theory*, vol. 13, no. 2, 8, pp. 1-24. https://doi.org/10.1145/3442352

#### APA

*ACM Transactions on Computation Theory*,

*13*(2), 1-24. [8]. https://doi.org/10.1145/3442352

#### Vancouver

#### Author

#### Bibtex

}

#### RIS

TY - JOUR

T1 - Fine-Grained Reductions from Approximate Counting to Decision

AU - Dell, Holger

AU - Lapinskas, John

PY - 2021

Y1 - 2021

N2 - In this article, 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 reductions for some of the most important problems in fine-grained complexity: the Orthogonal Vectors problem, 3SUM, and the Negative-Weight Triangle problem (which is closely related to All-Pairs Shortest Path). While all these problems have simple algorithms over which it is conjectured that no polynomial improvement is possible, our reductions would remain interesting even if these conjectures were proved; they have only polylogarithmic overhead and can therefore be applied to subpolynomial improvements such as the n3/ exp(Θ (√ log n))-time algorithm for the Negative-Weight Triangle problem due to Williams (STOC 2014). Our framework is also general enough to apply to versions of the problems for which more efficient algorithms are known. For example, the Orthogonal Vectors problem over GF(m)d for constant m can be solved in time n · poly (d) by a result of Williams and Yu (SODA 2014); our result implies that we can approximately count the number of orthogonal pairs with essentially the same running time.We also provide a fine-grained reduction from approximate #SAT to SAT. Suppose the Strong Exponential Time Hypothesis (SETH) is false, so that for some 1 < c < 2 and all k there is an O(cn)-time algorithm for k-SAT. Then we prove that for all k, there is an O(( c + o(1))n)-time algorithm for approximate #k-SAT. In particular, our result implies that the Exponential Time Hypothesis (ETH) is equivalent to the seemingly weaker statement that there is no algorithm to approximate #3-SAT to within a factor of 1+ɛ in time 2o(n)/ ɛ2 (taking ɛ > 0 as part of the input).

AB - In this article, 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 reductions for some of the most important problems in fine-grained complexity: the Orthogonal Vectors problem, 3SUM, and the Negative-Weight Triangle problem (which is closely related to All-Pairs Shortest Path). While all these problems have simple algorithms over which it is conjectured that no polynomial improvement is possible, our reductions would remain interesting even if these conjectures were proved; they have only polylogarithmic overhead and can therefore be applied to subpolynomial improvements such as the n3/ exp(Θ (√ log n))-time algorithm for the Negative-Weight Triangle problem due to Williams (STOC 2014). Our framework is also general enough to apply to versions of the problems for which more efficient algorithms are known. For example, the Orthogonal Vectors problem over GF(m)d for constant m can be solved in time n · poly (d) by a result of Williams and Yu (SODA 2014); our result implies that we can approximately count the number of orthogonal pairs with essentially the same running time.We also provide a fine-grained reduction from approximate #SAT to SAT. Suppose the Strong Exponential Time Hypothesis (SETH) is false, so that for some 1 < c < 2 and all k there is an O(cn)-time algorithm for k-SAT. Then we prove that for all k, there is an O(( c + o(1))n)-time algorithm for approximate #k-SAT. In particular, our result implies that the Exponential Time Hypothesis (ETH) is equivalent to the seemingly weaker statement that there is no algorithm to approximate #3-SAT to within a factor of 1+ɛ in time 2o(n)/ ɛ2 (taking ɛ > 0 as part of the input).

U2 - 10.1145/3442352

DO - 10.1145/3442352

M3 - Journal article

VL - 13

SP - 1

EP - 24

JO - ACM Transactions on Computation Theory

JF - ACM Transactions on Computation Theory

SN - 1942-3454

IS - 2

M1 - 8

ER -

ID: 86408152