O'Reilly logo

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

[bib03_1] [1] M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.

[bib03_2] [2] M. Davis and H. Putnam. A Computing Procedure for Quantification Theory. Journal of the ACM, 7(3):201–215, July 1960.

[bib03_3] [3] M. Davis, G. Logemann, and D. Loveland. A Machine Program for Theorem-Proving. Communications of the ACM, 5(7):394–397, July 1962.

[bib03_4] [4] J. Marques-Silva and K. Sakallah. GRASP: A Search Algorithm for Propositional Satisfiability. IEEE Transactions on Computers, 48(5):506–521, May 1999.

[bib03_5] [5] R. Bayardo and R. Schrag. Using CSP Lookback Techniques to Solve Real-World SAT Instances. Proceedings of the National Conference on Artificial Intelligence, pages 203–208, ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required