Sciweavers

SAT
2004
Springer
101views Hardware» more  SAT 2004»
14 years 4 months ago
Detecting Backdoor Sets with Respect to Horn and Binary Clauses
We study the parameterized complexity of detecting backdoor sets for instances of the propositional satisfiability problem (SAT) with respect to the polynomially solvable classes ...
Naomi Nishimura, Prabhakar Ragde, Stefan Szeider