随机投影下的收缩,以及 $\mathsf{AC}^0$ 的三次公式下界
Shrinkage under Random Projections, and Cubic Formula Lower Bounds for $\mathsf{AC}^0$
AI总结:
本文将 Håstad 的公式收缩性扩展到定制随机投影,据此为可在 $\mathsf{AC}^0$ 中计算的显式函数证明 $\widetildeΩ(n^3)$ 公式规模下界,并验证一类内部函数的 KRW 猜想。
摘要:
Håstad 证明,任何 De Morgan 公式(由 AND、OR 和 NOT 门组成)在使每个变量以概率 $p$ 独立保留的随机限制下,会按 $\tilde{O}(p^{2})$ 的因子收缩 [SICOMP, 1998]。利用该结果,他给出了 Andreev 函数的 $\widetildeΩ(n^{3})$ 公式规模下界;除去低阶改进,这仍是任何显式函数的最优下界。本文将 Håstad 的收缩结果扩展到范围广得多的一族随机限制及其推广——随机投影。基于我们的收缩结果,我们对一个可在 $\mathbf{AC}^0$ 中计算的显式函数获得 $\widetildeΩ(n^{3})$ 公式规模下界。这改进了此前仅为二次的 $\mathbf{AC}^0$ 最优已知公式规模下界。此外,我们证明 KRW 猜想 [Karchmer 等,Computational Complexity 5(3/4), 1995] 对无权量子对手界为紧的内部函数成立;特别地,它对具有紧 Khrapchenko 界的内部函数成立。我们的随机投影是针对函数结构定制的,使函数即使在投影下仍保持结构——使用这种投影是必要的,因为标准随机限制会简化 $\mathbf{AC}^0$ 电路。相比之下,我们证明任何 De Morgan 公式在我们的随机投影下都按二次因子收缩,从而能够证明三次下界。我们的证明技术建立在 Håstad 针对更简单的平衡公式情形的证明之上。这以稍差的参数为代价,带来了显著更简单的证明。因此,当专门用于 $p$-随机限制情形时,我们的证明可作为 Håstad 结果的阐释。
英文摘要:
$\newcommand{\ACz}{\mathbf{AC}^0}$ Håstad showed that any De Morgan formula (composed of AND, OR and NOT gates) shrinks by a factor of $\tilde{O}(p^{2})$ under a random restriction that leaves each variable alive independently with probability $p$ [SICOMP, 1998]. Using this result, he gave an $\widetildeΩ(n^{3})$ formula size lower bound for the Andreev function, which, up to lower order improvements, remains the state-of-the-art lower bound for any explicit function. In this paper, we extend the shrinkage result of Håstad to hold under a far wider family of random restrictions and their generalization -- random projections. Based on our shrinkage results, we obtain an $\widetildeΩ(n^{3})$ formula size lower bound for an explicit function computable in $\ACz$. This improves upon the best known formula size lower bounds for $\ACz$, that were only quadratic prior to our work. In addition, we prove that the KRW conjecture [Karchmer et al., Computational Complexity 5(3/4), 1995] holds for inner functions for which the unweighted quantum adversary bound is tight. In particular, this holds for inner functions with a tight Khrapchenko bound. Our random projections are tailor-made to the function's structure so that the function maintains structure even under projection -- using such projections is necessary, as standard random restrictions simplify $\ACz$ circuits. In contrast, we show that any De Morgan formula shrinks by a quadratic factor under our random projections, allowing us to prove the cubic lower bound. Our proof techniques build on Håstad's proof for the simpler case of balanced formulas. This allows for a significantly simpler proof at the cost of slightly worse parameters. As such, when specialized to the case of $p$-random restrictions, our proof can be used as an exposition of Håstad's result.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。