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.
对于布尔可满足性问题,解空间的结构由解图表征,其中顶点是解,并且两个解连通当且仅当它们在一个变量上不同。对于这个隐式定义的图,我们在这里研究st-连通性和连通性问题。基于Gopalan et al.(“The Connectivity of Boolean Satisfiability:Computational and Structural Dichotomies”,2006/2009),我们首先研究了由CSP给出的可满足性问题,更确切地说是由带常数的CNF(S)-公式给出的可满足性问题(如Schaefer在1978年著名的二分法定理中所考虑的);我们证明了ST-连通性问题的计算二分法,断言它要么在多项式时间内可解,要么是PSPACE-完全的,并且是对齐的结构二分法,断言,连接组件的最大直径是线性的变量的数量,或者可以是指数;此外,我们显示了一个连通性问题的剖分,断言它是在P,CONP-完全,或PSPACE-完全。接下来,我们调查两个重要的变种:CNF(S)-公式没有常数,部分量化的公式;在这两种情况下,我们证明了类似的二分法的ST-连接和直径;对于连接问题,我们显示了一个二分法的情况下,量化的公式,而在没有常数的公式的情况下,我们确定一个可能的二分法的片段。最后,我们考虑B-公式的连通性问题,这是任意嵌套的公式建立从一些固定的连接词集B,和B-电路,这是布尔电路的门是从一些有限…