arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1707.04609cs.DScs.CC
收藏

从近似计数到决策的细粒度约简

Fine-grained reductions from approximate counting to decision

Holger Dell, John Lapinskas

摘要:

在本文中,我们介绍了一个一般框架细粒度约简近似计数问题的决策版本。(Thus我们使用一个决定是否存在任何见证人的预言机,以最小的开销乘性地近似见证人的数量。这反映了Sipser(STOC 1983)和Stockmeyer(SICOMP 1985)在多项式时间设置下的基本结果,以及Müller(IWPEC 2006)在FPT设置下的类似结果。使用我们的框架,我们获得了一些最重要的细粒度复杂性问题的减少:正交向量问题,3SUM,和负权重三角形问题(这是密切相关的所有对最短路径)。我们还提供了从近似#SAT到SAT的细粒度减少。假设强指数时间假设(SETH)为假,则对于某些$1<c<2$和所有$k$,存在用于k-SAT的$O(c^n)$时间算法。然后证明了对于所有的$k$,存在一个近似于# $k$ -SAT的$O((c+o(1))^n)$ -时间算法.特别是,我们的结果意味着指数时间假设(ETH)等价于一个非常弱的陈述,即没有算法可以在时间上将#3-SAT近似到$1+ε$的因子$2^{o(n)}/ε^2$(将$ε> 0$作为输入的一部分)。

英文摘要:

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 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). 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(c^n)$-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 $2^{o(n)}/ε^2$ (taking $ε> 0$ as part of the input).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑