A Critique of Sopin's "PH = PSPACE"
share
We critique Valerii Sopin's paper "PH = PSPACE" [Sop14]. The paper claims to resolve one of the major open problems of theoretical computer science by leveraging the Skolemization of existential quantifiers of quantified boolean formulas to show that QBF (a well-known PSPACE-complete problem) is in Π_4^p, and thus PH = PSPACE. In this critique, we highlight problems in that paper and conclude that it fails to establish that PH = PSPACE.
READ FULL TEXT