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

局部枚举与多数下界

Local Enumeration and Majority Lower Bounds

Mohit Gurumukhani, Ramamohan Paturi, Pavel Pudlák, Michael Saks, Navid Talebanfard

AI总结:

本文定义Enum(k,t)问题,揭示深度3电路下界与k-SAT算法的新联系,并提出随机算法,将多数函数的Σ³₃下界改进至1.251ⁿ。

摘要:

深度3电路下界与$k$-SAT算法密切相关;最先进的$\Sigma^k_3$电路下界和$k$-SAT算法基于同一个组合定理。在本文中,我们定义了一个问题,揭示了这两者之间的新相互作用。定义Enum($k$, $t$)问题为:给定一个$n$变量的$k$-CNF和一个初始赋值$\alpha$,输出所有与$\alpha$的汉明距离为$t$的满足赋值,假设不存在与$\alpha$的汉明距离小于$t$的满足赋值。观察到:Enum($k$, $t$)复杂度的上界$b(n, k, t)$蕴含:\n- 深度3电路:任何计算多数函数的$\Sigma^k_3$电路的大小至少为$\binom{n}{\frac{n}{2}}/b(n, k, \frac{n}{2})$。\n- $k$-SAT:存在一个在时间$O(\sum_{t = 1}^{n/2}b(n, k, t))$内求解$k$-SAT的算法。\n一个简单的构造表明$b(n, k, \frac{n}{2}) \ge 2^{(1 - O(\log(k)/k))n}$。因此,匹配的上界将蕴含$\Sigma^k_3$电路下界$2^{\Omega(\log(k)n/k)}$和$k$-SAT上界$2^{(1 - \Omega(\log(k)/k))n}$。前者产生无限制深度3下界$2^{\omega(\sqrt{n})}$,解决了一个长期悬而未决的问题,后者打破了超强指数时间假设。\n在本文中,我们为Enum($k$, $t$)提出了一种随机算法,并引入了新的分析思路。我们通过考虑该问题的第一个非平凡实例,即Enum($3$, $\frac{n}{2}$),来展示我们思路的力量。我们表明,我们算法的期望运行时间为$1.598^n$,显著改进了平凡的$3^{n/2} \simeq 1.732^n$上界。这已经将多数函数的$\Sigma^3_3$下界改进到$1.251^n$。之前的界是$1.154^n$,源自Håstad、Jukna和Pudlák的工作(Comput. Complex.'95)。

英文摘要:

Depth-3 circuit lower bounds and $k$-SAT algorithms are intimately related; the state-of-the-art $Σ^k_3$-circuit lower bound and the $k$-SAT algorithm are based on the same combinatorial theorem. In this paper we define a problem which reveals new interactions between the two. Define Enum($k$, $t$) problem as: given an $n$-variable $k$-CNF and an initial assignment $α$, output all satisfying assignments at Hamming distance $t$ from $α$, assuming that there are no satisfying assignments of Hamming distance less than $t$ from $α$. Observe that: an upper bound $b(n, k, t)$ on the complexity of Enum($k$, $t$) implies: - Depth-3 circuits: Any $Σ^k_3$ circuit computing the Majority function has size at least $\binom{n}{\frac{n}{2}}/b(n, k, \frac{n}{2})$. - $k$-SAT: There exists an algorithm solving $k$-SAT in time $O(\sum_{t = 1}^{n/2}b(n, k, t))$. A simple construction shows that $b(n, k, \frac{n}{2}) \ge 2^{(1 - O(\log(k)/k))n}$. Thus, matching upper bounds would imply a $Σ^k_3$-circuit lower bound of $2^{Ω(\log(k)n/k)}$ and a $k$-SAT upper bound of $2^{(1 - Ω(\log(k)/k))n}$. The former yields an unrestricted depth-3 lower bound of $2^{ω(\sqrt{n})}$ solving a long standing open problem, and the latter breaks the Super Strong Exponential Time Hypothesis. In this paper, we propose a randomized algorithm for Enum($k$, $t$) and introduce new ideas to analyze it. We demonstrate the power of our ideas by considering the first non-trivial instance of the problem, i.e., Enum($3$, $\frac{n}{2}$). We show that the expected running time of our algorithm is $1.598^n$, substantially improving on the trivial bound of $3^{n/2} \simeq 1.732^n$. This already improves $Σ^3_3$ lower bounds for Majority function to $1.251^n$. The previous bound was $1.154^n$ which follows from the work of Håstad, Jukna, and Pudlák (Comput. Complex.'95).

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

↑