arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1905.12935cs.CCmath.LO
收藏

电路下界与有界理论的一致性

Consistency of circuit lower bounds with bounded theories

Jan Bydzovsky, Jan Krajicek, Igor C. Oliveira

AI总结:

从逻辑视角研究电路复杂性,证明有界理论T与计算类C不包含于无穷多次SIZE(n^k)一致,表明这些理论无法证明相应问题的无穷多次电路上界。

摘要:

证明存在$\u005cmathsf{P}^\u005cmathsf{NP}$中的问题需要超线性规模的布尔电路是复杂性理论中的一个主要前沿问题。虽然对于更大的复杂性类别已知这样的下界,但现有结果仅表明相应问题在无穷多个输入长度上是困难的。例如,即使对于$\u005cmathsf{MAEXP}$中的问题,证明几乎处处电路下界也是开放的。鉴于证明对所有大输入长度成立的下界的众所周知的困难,我们提出以下问题:我们能否证明一大类技术无法证明$\u005cmathsf{NP}$无穷多次是容易的?受此以及关于数学证明与计算之间相互作用的相关问题的启发,我们从逻辑的角度研究电路复杂性。\n\n在其他结果中,我们证明对于任何参数$k \u005cgeq 1$,与理论$T$一致的是计算类${\u005cmathcal C} \u005cnot \u005csubseteq \u005cit.i.o.\u005cmathrm{SIZE}(n^k)$,其中$(T, \u005cmathcal{C})$是以下配对之一:$T = \u005cmathsf{T}^1_2$且${\u005cmathcal C} = \u005cmathsf{P}^\u005cmathsf{NP}$,$T = \u005cmathsf{S}^1_2$且${\u005cmathcal C} = \u005cmathsf{NP}$,$T = \u005cmathsf{PV}$且${\u005cmathcal C} = \u005cmathsf{P}$。换言之,这些理论无法为相应问题建立无穷多次电路上界。这之所以有趣,是因为较弱的理论$\u005cmathsf{PV}$已经形式化了复杂的论证,例如PCP定理的证明。这些一致性陈述是无条件的,并改进了[KO17]和[BM18]关于下界与$\u005cmathsf{PV}$一致性的早期定理。

英文摘要:

Proving that there are problems in $\mathsf{P}^\mathsf{NP}$ that require boolean circuits of super-linear size is a major frontier in complexity theory. While such lower bounds are known for larger complexity classes, existing results only show that the corresponding problems are hard on infinitely many input lengths. For instance, proving almost-everywhere circuit lower bounds is open even for problems in $\mathsf{MAEXP}$. Giving the notorious difficulty of proving lower bounds that hold for all large input lengths, we ask the following question: Can we show that a large set of techniques cannot prove that $\mathsf{NP}$ is easy infinitely often? Motivated by this and related questions about the interaction between mathematical proofs and computations, we investigate circuit complexity from the perspective of logic. Among other results, we prove that for any parameter $k \geq 1$ it is consistent with theory $T$ that computational class ${\mathcal C} \not \subseteq \textit{i.o.}\mathrm{SIZE}(n^k)$, where $(T, \mathcal{C})$ is one of the pairs: $T = \mathsf{T}^1_2$ and ${\mathcal C} = \mathsf{P}^\mathsf{NP}$, $T = \mathsf{S}^1_2$ and ${\mathcal C} = \mathsf{NP}$, $T = \mathsf{PV}$ and ${\mathcal C} = \mathsf{P}$. In other words, these theories cannot establish infinitely often circuit upper bounds for the corresponding problems. This is of interest because the weaker theory $\mathsf{PV}$ already formalizes sophisticated arguments, such as a proof of the PCP Theorem. These consistency statements are unconditional and improve on earlier theorems of [KO17] and [BM18] on the consistency of lower bounds with $\mathsf{PV}$.

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

↑