索平"${\rm PH} = {\rm PSPACE}$"批评
A Critique of Sopin's "${\rm PH} = {\rm PSPACE}$"
摘要：
我们批判Valerii Sopin的论文"${\rm PH} = {\rm PSPACE}$"[Sop14]。该论文声称通过利用量化布尔公式的存在量词的Skolemization来解决理论计算机科学的主要开放问题之一，以表明${\rm QBF}$（一个著名的${\rm PSPACE}$-完全问题）在$Π_4^p$中，因此是${\rm PH} = {\rm PSPACE}$。在这篇评论中，我们强调了该论文中的问题，并得出结论，它未能建立${\rm PH} = {\rm PSPACE}$。
英文摘要：
We critique Valerii Sopin's paper "${\rm PH} = {\rm 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 ${\rm QBF}$ (a well-known ${\rm PSPACE}$-complete problem) is in $Π_4^p$, and thus ${\rm PH} = {\rm PSPACE}$. In this critique, we highlight problems in that paper and conclude that it fails to establish that ${\rm PH} = {\rm PSPACE}$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
