Exploració per tema "QBF"
Ara es mostren els items 1-1 de 1
-
Bounded-width QBF is PSPACE-complete
(Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013)
Text en actes de congrés
Accés obertTree-width is a well-studied parameter of structures that measures their similarity to a tree. Many important NP-complete problems, such as Boolean satisfiability (SAT), are tractable on bounded tree-width instances. In ...