collected by | Ian P. Gent ipg@cs.strath.ac.uk | Toby Walsh tw@cs.strath.ac.uk |
Algorithms for the Satisfiability (SAT) Problem: A Survey
J. Gu, P. W. Purdom, J. Franco, and B. W. Wah, in
"Satisfiability Problem: Theory and Applications", DIMACS Series in Discrete
Mathematics and Theoretical Computer Science, American Mathematical Society, 1997, pp. 19-152.
Finding Hard Instances of the Satisfiability Problem: A Survey
S.A. Cook and D.G. Mitchell, in
"Satisfiability Problem: Theory and Applications", DIMACS Series in Discrete
Mathematics and Theoretical Computer Science, American Mathematical Society, 1997.