Browsing by Subject "QBF"
Now showing items 1-1 of 1
(Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013)
Open AccessTree-width is a well-studied parameter of structures that measures their similarity to a tree. Many important NP-complete problems, such as Boolean satisﬁability (SAT), are tractable on bounded tree-width instances. In ...