SAT
2004
Springer
13 years 10 months ago
2004
Springer
We study the parameterized complexity of detecting backdoor sets for instances of the propositional satisfiability problem (SAT) with respect to the polynomially solvable classes ...
CPAIOR
2009
Springer
13 years 11 months ago
2009
Springer
There has been considerable interest in the identification of structural properties of combinatorial problems that lead, directly or indirectly, to the development of efficient al...