A Critique of Sopin's " PH = PSPACE"
Abstract
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 4p, and thus PH = PSPACE. In this critique, we highlight problems in that paper and conclude that it fails to establish that PH = PSPACE.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.