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


Knowing a Backdoor Sets 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… (More)
DOI: 10.1007/978-3-540-79719-7_16


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics