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

Cached

Download Links

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

Documents Related by Co-Citation

1084 A computing procedure for quantification theory – Martin Davis, Hilary Putnam - 1960
742 A machine program for theorem proving – Martin Davis, George Logemann, Donald Loveland - 1962
204 Using CSP look-back techniques to solve real-world SAT instances – Roberto J. Bayardo - 1997
270 Local Search Strategies for Satisfiability Testing – Bart Selman, Henry Kautz, Bram Cohen - 1995
202 Experimental Results on the Crossover Point in Satisfiability Problems – James M. Crawford, Larry D. Auton - 1993
521 Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search – Henry Kautz, Bart Selman - 1996
121 Heuristics based on unit propagation for satisfiability problems – Chu Min Li - 1997
431 Planning as satisfiability – Henry Kautz, Bart Selman - 1992
358 GRASP - A New Search Algorithm for Satisfiability – Joso L Marques Silva - 1996
214 Many hard examples for resolution – V Chvátal, E Szemerédi - 1988
960 Fast Planning Through Planning Graph Analysis – Avrim L. Blum, Merrick L. Furst - 1995
98 Generating Hard Satisfiability Problems – Bart Selman, David Mitchell, Hector Levesque - 1996
7069 Probabilistic Reasoning in Intelligent Systems – J Pearl - 1988
173 Determining computational complexity from characteristic ‘phase transitions – R Monasson, R Zecchina, S Kirkpatrick, B Selman, L Troyansky - 1999
683 A New Method for Solving Hard Satisfiability Problems – Bart Selman, Hector Levesque, David Mitchell - 1992
49 An Empirical Analysis of Search in GSAT – Ian Gent, Toby Walsh - 1993
71 MAXPLAN: A New Approach to Probabilistic Planning – Stephen M. Majercik, Michael L. Littman - 1998
83 Ten challenges in propositional reasoning and search – Bart Selman, Henry Kautz, David Mcallester - 1997
219 Hard and Easy Distributions of SAT Problems – David Mitchell, Bart Selman, Hector Levesque - 1992