Depth-3 circuit lower bounds and $k$-SAT algorithms are intimately related; the state-of-the-art $\Sigma^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 $\alpha$, output all satisfying assignments at Hamming distance $t$ from $\alpha$, assuming that there are no satisfying assignments of Hamming distance less than $t$ from $\alpha$. Observe that: an upper bound $b(n, k, t)$ on the complexity of Enum($k$, $t$) implies: - Depth-3 circuits: Any $\Sigma^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 $\Sigma^k_3$-circuit lower bound of $2^{\Omega(\log(k)n/k)}$ and a $k$-SAT upper bound of $2^{(1 - \Omega(\log(k)/k))n}$. The former yields an unrestricted depth-3 lower bound of $2^{\omega(\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 $\Sigma^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{\aa}stad, Jukna, and Pudl\'ak (Comput. Complex.'95).

翻译：深度-3电路下界与$k$-SAT算法具有深刻的内在关联；目前最先进的$\Sigma^k_3$电路下界与$k$-SAT算法均基于相同的组合定理。本文定义了一个能揭示两者间新交互关系的问题。定义枚举问题Enum($k$, $t$)为：给定一个包含$n$个变量的$k$-CNF公式及初始赋值$\alpha$，输出所有与$\alpha$汉明距离为$t$的可满足赋值，且假设不存在与$\alpha$汉明距离小于$t$的可满足赋值。观察发现：若$b(n, k, t)$表示Enum($k$, $t$)的复杂度上界，则可推得：- 深度-3电路：任何计算多数函数的$\Sigma^k_3$电路规模至少为$\binom{n}{\frac{n}{2}}/b(n, k, \frac{n}{2})$。- $k$-SAT：存在时间复杂度为$O(\sum_{t = 1}^{n/2}b(n, k, t))$的$k$-SAT求解算法。通过简单构造可证明$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}$。前者将产生$2^{\omega(\sqrt{n})}$的无限制深度-3电路下界，从而解决长期悬而未决的开放问题；后者将打破超强指数时间假说。本文针对Enum($k$, $t$)提出随机算法并引入新思路进行分析。通过研究该问题的首个非平凡实例Enum($3$, $\frac{n}{2}$)，我们展示了新方法的有效性。证明该算法的期望运行时间为$1.598^n$，较平凡上界$3^{n/2} \simeq 1.732^n$有显著提升。该结果已将多数函数的$\Sigma^3_3$电路下界改进至$1.251^n$。此前由H{\aa}stad、Jukna与Pudl\'ak（Comput. Complex.'95）的工作推导的下界为$1.154^n$。