• Bounded-width QBF is PSPACE-complete 

    Atserias, Albert; Oliva Valls, Sergi (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013)
    Text en actes de congrés
    Accés obert
    Tree-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 ...