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
CPAIOR
2009
Springer
14 years 5 months ago
Backdoors to Combinatorial Optimization: Feasibility and Optimality
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...
Bistra N. Dilkina, Carla P. Gomes, Yuri Malitsky, ...