A Critique of Sopin's "PH = PSPACE"

12/09/2022
by   Michael C. Chavrimootoo, et al.
0

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
research
03/01/2021

Extending Prolog for Quantified Boolean Horn Formulas

Prolog is a well known declarative programming language based on proposi...
research
02/12/2018

Symmetries of Quantified Boolean Formulas

While symmetries are well understood for Boolean formulas and successful...
research
05/01/2019

Computer Science and Metaphysics: A Cross-Fertilization

Computational philosophy is the use of mechanized computational techniqu...
research
11/17/2017

Exploring the Use of Shatter for AllSAT Through Ramsey-Type Problems

In the context of SAT solvers, Shatter is a popular tool for symmetry br...
research
01/21/2020

Some General Structure for Extremal Sparsification Problems

This paper is about a branch of theoretical computer science that studie...
research
01/11/2021

Freezing sandpiles and Boolean threshold networks: equivalence and complexity

The NC versus P-hard classification of the prediction problem for sandpi...
research
08/10/2022

Saturation-based Boolean conjunctive query answering and rewriting for the guarded quantification fragments

Answering Boolean conjunctive query over logical constraints is an essen...

Please sign up or login with your details

Forgot password? Click here to reset