Abstract
We survey and compare parameterizations of the propositional satisfiability problem (SAT) in the framework of Parameterized Complexity (Downey and Fellows, 1999). In particular, we consider (a) parameters based on structural graph decompositions (tree-width, branch-width, and clique-width), (b) a parameter emerging from matching theory (maximum deficiency), and (c) a parameter defined by translating clause-sets into certain implicational formulas (falsum number). © Springer-Verlag 2004.
Cite
CITATION STYLE
Szeider, S. (2004). On fixed-parameter tractable parameterizations of SAT. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2919, 188–202. https://doi.org/10.1007/978-3-540-24605-3_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
