Login / Signup

Placing quantified variants of 3-SAT and Not-All-Equal 3-SAT in the polynomial hierarchy.

Janosch DöckerBritta DornSimone LinzCharles Semple
Published in: Theor. Comput. Sci. (2020)
Keyphrases
  • satisfiability problem
  • polynomial hierarchy
  • sat solvers
  • search algorithm
  • search strategies
  • phase transition
  • np complete
  • disjunctive logic programming