常深与多线性理想证明系统的分离结果
Separation Results for Constant-Depth and Multilinear Ideal Proof Systems
AI总结:
本文通过功能性方法和倍数方法,证明了常深IPS和多线性IPS的分离定理,展示了不可满足实例的反驳复杂性。
摘要:
在本工作中,我们建立了几个IPS子系统的分离定理。IPS是一种代数证明系统,由Grochow和Pitassi(J. ACM, 2018)引入。分离定理在经典复杂度理论、布尔电路复杂度和代数复杂度的背景下已被广泛研究。在Forbes、Shpilka、Tzameret和Wigderson(ToC, 2021)的重要工作中,两种证明技术被引入以证明IPS子系统的下界,即功能性方法和倍数方法。我们使用这些技术并获得了以下结果。常深IPS的层次定理:最近,Limaye、Srinivasan和Tavenas(J. ACM 2025)证明了常深代数电路的层次定理。我们借鉴该结果并证明了常深IPS的层次定理。我们展示了一个不可满足的多线性实例,其可以通过深度Δ的IPS进行反驳,但任何深度Δ/10的IPS反驳必须具有超多项式大小。这一结果是基于倍数方法建立的。多线性IPS的分离定理:在一项有影响力的工作中,Raz(ToC, 2006)无条件地分离了两个代数复杂度类,即多线性NC¹从多线性NC²。在本工作中,我们为一个广受研究的多线性-IPS片段证明了类似的结果。具体来说,我们展示了一个不可满足的实例,其功能性反驳,即唯一与多项式在布尔立方上一致的多项式,具有小的多线性NC²电路。然而,任何多线性NC¹ IPS反驳(IPS_LIN)对于它必须具有超多项式大小。这一结果是基于功能性方法建立的。
英文摘要:
In this work, we establish separation theorems for several subsystems of the Ideal Proof System (IPS), an algebraic proof system introduced by Grochow and Pitassi (J. ACM, 2018). Separation theorems are well-studied in the context of classical complexity theory, Boolean circuit complexity, and algebraic complexity. In an important work of Forbes, Shpilka, Tzameret, and Wigderson (ToC, 2021), two proof techniques were introduced to prove lower bounds for subsystems of the IPS, namely the functional method and the multiples method. We use these techniques and obtain the following results. Hierarchy theorem for constant-depth IPS: Recently, Limaye, Srinivasan, and Tavenas (J. ACM 2025) proved a hierarchy theorem for constant-depth algebraic circuits. We adapt the result and prove a hierarchy theorem for constant-depth $\mathsf{IPS}$. We show that there is an unsatisfiable multilinear instance refutable by a depth-$Δ$ $\mathsf{IPS}$ such that any depth-($Δ/10)$ $\mathsf{IPS}$ refutation for it must have superpolynomial size. This result is proved by building on the multiples method. Separation theorems for multilinear IPS: In an influential work, Raz (ToC, 2006) unconditionally separated two algebraic complexity classes, namely multilinear $\mathsf{NC}^{1}$ from multilinear $\mathsf{NC}^{2}$. In this work, we prove a similar result for a well-studied fragment of multilinear-$\mathsf{IPS}$. Specifically, we present an unsatisfiable instance such that its functional refutation, i.e., the unique multilinear polynomial agreeing with the inverse of the polynomial over the Boolean cube, has a small multilinear-$\mathsf{NC}^{2}$ circuit. However, any multilinear-$\mathsf{NC}^{1}$ $\mathsf{IPS}$ refutation ($\mathsf{IPS}_{\mathsf{LIN}}$) for it must have superpolynomial size. This result is proved by building on the functional method.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。