Finding Hard Instances of the Satisfiability Problem: A Survey (1997)

Cached

Download Links

by Stephen A. Cook , David G. Mitchell
Citations:118 - 1 self

Documents Related by Co-Citation

11073 Computers and Intractability: A Guide to the Theory of NP-Completeness – M R Garey, D S Johnson - 1979
1082 A computing procedure for quantification theory – M DAVIS, H PUTNAM - 1960
752 A Machine Program for Theorem Proving – M Davis, G Logemann, D Loveland - 1962
528 Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search – Henry Kautz, Bart Selman - 1996
276 Local Search Strategies for Satisfiability Testing – Bart Selman, Henry Kautz, Bram Cohen - 1995
208 Using CSP look-back techniques to solve real-world SAT instances – Roberto J. Bayardo - 1997
435 Planning as satisfiability – Henry Kautz, Bart Selman - 1992
968 Fast Planning Through Planning Graph Analysis – Avrim L. Blum, Merrick L. Furst - 1995
7195 Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference – J Pearl - 1988