Quantified 3-SAT stays Π_2^P-complete when every variable appears exactly four times, and quantified Not-All-Equal 3-SAT stays Π_2^P-complete for linear monotone formulas with each universal variable appearing once, while some variants become NP-complete or polynomial-time solvable.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Placing quantified variants of 3-SAT and Not-All-Equal 3-SAT in the polynomial hierarchy
Quantified 3-SAT stays Π_2^P-complete when every variable appears exactly four times, and quantified Not-All-Equal 3-SAT stays Π_2^P-complete for linear monotone formulas with each universal variable appearing once, while some variants become NP-complete or polynomial-time solvable.