A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors

@inproceedings{Kottler2008ANB,
  title={A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors},
  author={Stephan Kottler and Michael Kaufmann and Carsten Sinz},
  booktitle={SAT},
  year={2008}
}
Knowing a Backdoor Set B for a given SAT instance, satisfiability can be decided by only examining each of the 2|B| truth assignments of the variables in B. However, one problem is to efficiently find a small backdoor up to a particular size and, furthermore, if no backdoor of the desired size could be found, there is in general no chance to conclude anything about satisfiability. In this paper we introduce a complete deterministic algorithm for an NP-hard subclass of 3-SAT, that is also a… CONTINUE READING

Topics from this paper.