Bilateral Treewidth for QBF: Where Strategies and Resolution Meet

Robert Ganian, Marlene Gründel

Treewidth is a well-studied decompositional parameter to measure the tree-likeness of a graph. While the propositional satisfiability problem (SAT) is known to be tractable when pa…