arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1411.0628cs.CCcs.DSmath.GM
收藏

PH = PSPACE

PH = PSPACE

Valerii Sopin

摘要:

在本文中,我们证明了PSPACE是等于第4级的多项式的层次。我们还推导出了许多重要的结果。真量化布尔公式是布尔可满足性问题的推广,其中确定满足给定布尔公式的解释被布尔函数的存在所取代,使得给定的QBF是重言式。这些函数称为Skolem函数。证明的基本思想是证明对于任何量化的布尔公式$ϕ$,我们可以得到一个公式$ϕ'$,它在多项式层次的第4层,不超过给定$ϕ$大小的多项式,使得$ϕ$的真值可以由$ϕ'$的真值确定。这个想法是skolemize,然后在skolemized前缀内使用多项式层次结构的第二层的额外公式来强制执行skolem变量确实只依赖于它们应该依赖的通用量化变量。然而,当量化反转时,一些依赖性丢失。它被称为“异或问题”,因为函数依赖性可以通过异或公式来表示。因此,需要定位这些XOR,但不需要定位所有具有XOR的链:任何链都只包含两个变量的XOR。最后一个可以在每次迭代中本地完成(记住代数范式(ANF)),当所有参数都指定时,即作为多项式子例程。相对化是失败的,由于众所周知的事实:PH = PSPACE当且仅当有限结构上的二阶逻辑没有从添加传递闭包算子中获得额外的能力。由于论证的有限可能性,交换是可能的。因此,预言机定理不适用,因为随机预言机是一个任意集合。这就是为什么相对于概率为1的随机预言,PH是无限的。

英文摘要:

In this paper we show that PSPACE is equal to 4th level in the polynomial hierarchy. We also deduce a lot of important consequences. True quantified Boolean formula is a generalisation of the Boolean Satisfiability Problem, where determining of interpretation that satisfies a given Boolean formula is replaced by existence of Boolean functions that makes a given QBF to be tautology. Such functions are called the Skolem functions. The essential idea of the proof is to show that for any quantified Boolean formula $ϕ$ we can obtain a formula $ϕ'$ which is in the 4th level of the polynomial hierarchy, no more than polynomial in the size of a given $ϕ$, such that the truth of $ϕ$ can be determined from the truth of $ϕ'$. The idea is to skolemize, and then use additional formulas from the 2nd level of the polynomial hierarchy inside the skolemized prefix to enforce that the skolem variables indeed depend only on the universally quantified variables they are supposed to. However, some dependence is lost when the quantification is reversed. It is called "XOR issue" because the functional dependence can be expressed by means of an XOR formula. Thus, it is needed to locate these XORs, but there is no need to locate all chains with XORs: any chain includes a XOR of only two variables. The last can be done locally in each iteration (keep in mind the algebraic normal form (ANF)), when all arguments are specified, i.e. as a polynomial subroutine. Relativization is defeated due to the well-known fact: PH = PSPACE iff second-order logic over finite structures gains no additional power from the addition of a transitive closure operator. The exchange is possible due to finite possibilities for arguments. So, the theorems with oracles are not applicable since a random oracle is an arbitrary set. And that's why PH is infinite relative to a random oracle with probability 1.

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

↑