Modern Techniques for Solving Boolean Satisfiability
Andreas Weis · 2006
The problem of Boolean satisfiability (SAT) belongs to the class of NPcomplete problems, which are currently believed to have exponential worst case complexity. However, in the recent past there have been many successful attempts to build algorithms, that are able to solve the majority of