多数函数的最优单调深度三电路下界
The Exact Complexity of Majority in Depth-Three Circuits with Bottom Fan-in Three
AI总结:
本文提出了一种最优算法,解决了k=3的单调公式局部枚举问题,并获得了计算多数函数的单调深度三电路的最优下界。
摘要:
Gurumuhkani等人(CCC'24)引入了局部枚举问题Enum(k, t):对于自然数k和参数t,给定一个n变量的k-CNF公式,该公式没有满足赋值的汉明权重小于t(n),枚举所有汉明权重恰好为t(n)的满足赋值。他们证明了高效的局部枚举算法可以带来新的k-SAT算法和多数函数的深度三下界。作为第一个非平凡情况,他们给出了k=3的算法,特别地,给出了一个新下界,即深度三电路的大小,其底部扇入度至多为3,计算多数函数。在本文中,我们给出一个最优算法,解决k=3和所有t≤n/2的单调公式中的局部枚举问题。特别地,我们获得了单调深度三电路的大小下界,该电路的底部扇入度至多为3,计算多数函数。
英文摘要:
Lecomte and Ramakrishnan (arXiv'26) recently presented a depth-three circuit of size $2^{O(\sqrt{n})}$ that computes the Majority function, refuting a long held conjecture. Nevertheless, as a fundamental computational primitive which ubiquitously appears across computer science, determining the exact complexity of Majority down to the constant in the exponent, remains important. Gurumukhani et al. (CCC'24) initiated the study of optimal $Σ^k_3$ circuits computing the Majority function. In this work, we determine the exact $Σ^3_3$ complexity of Majority up to polynomial factors. We show that for any $t \le n/2$, given an $n$-variate $t$-threshold 3-CNF, i.e., with no satisfying assignment with Hamming weight less than $t$, the number of weight-$t$ satisfying assignments is at most $2^t(3/2)^{(n-t)/2}$. Along with a matching construction for $t = n/2$, the result implies that the size of the smallest $Σ^3_3$ circuit computing Majority is exactly $poly(n)(2/6^{1/4})^n$. The proof involves two main ingredients: - Reduction to monotone: We formulate a linear program (LP) which is defined only with respect to the monotone part of the formula. We show that bounding the cost function of this LP implies our desired upper bound on the number of minimum weight solutions of the general formula. - Structure of extremal formulas: To bound the cost function of the LP, we develop an extensive inductive argument. The inductive steps are determined by a close inspection of the local structure of extremal formulas with respect to minimum weight. Our result has a natural hypergraph interpretation: it bounds the number of independent sets of size $n-t$ under the condition that the independence number is $n-t$. This is a generalized hypergraph Turán problem and coincides with the classical hypergraph Turán problem at threshold $t=n-k$ for $k$-uniform hypergraphs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。