Fixed-parameter tractability and completeness II: on completeness for W[1]
Theoretical Computer Science
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
The backdoor key: a path to understanding problem hardness
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Backdoors to typical case complexity
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Backdoor Sets of Quantified Boolean Formulas
Journal of Automated Reasoning
Backdoors in the Context of Learning
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Data reductions, fixed parameter tractability, and random weighted d-CNF satisfiability
Artificial Intelligence
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Backdoor sets of quantified boolean formulas
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Tradeoffs in the complexity of backdoor detection
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Random instances of W[2]-complete problems: thresholds, complexity, and algorithms
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Computation of renameable Horn backdoors
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
The parameterized complexity of editing graphs for bounded degeneracy
Theoretical Computer Science
On guaranteeing polynomially bounded search tree size
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Solving #SAT using vertex covers
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
From approximate clausal reasoning to problem hardness
AI'11 Proceedings of the 24th international conference on Advances in Artificial Intelligence
The Multivariate Algorithmic Revolution and Beyond
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Crowdsourcing backdoor identification for combinatorial optimization
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
We study the parameterized complexity of detecting small backdoor sets for instances of the propositional satisfiability problem (SAT). The notion of backdoor sets has been recently introduced by Williams, Gomes, and Selman for explaining the `heavy-tailed' behavior of backtracking algorithms. If a small backdoor set is found, then the instance can be solved efficiently by the propagation and simplification mechanisms of a SAT solver. Empirical studies indicate that structured SAT instances coming from practical applications have small backdoor sets. We study the worst-case complexity of detecting backdoor sets with respect to the simplification and propagation mechanisms of the classic Davis---Logemann---Loveland (DLL) procedure. We show that the detection of backdoor sets of size bounded by a fixed integer k is of high parameterized complexity. In particular, we determine that this detection problem (and some of its variants) is complete for the parameterized complexity class W[P]. We achieve this result by means of a generalization of a reduction due to Abrahamson, Downey, and Fellows.