On the Random Generation of 3-SAT Instances (1995)

Cached

Download Links

by Antoine Rauzy
Venue:LABORATOIRE BORDELAIS DE RECHERCHE EN INFORMATIQUE, UNIVERSITE BORDEAUX I
Citations:2 - 0 self

Active Bibliography

125 Algorithms for the Satisfiability (SAT) Problem: A Survey – Jun Gu, Paul W. Purdom, John Franco, Benjamin W. Wah - 1996
14 The search for Satisfaction – Ian P. Gent, Toby Walsh - 1999
22 Satisfiability Solvers – Carla P. Gomes, Henry Kautz, Ashish Sabharwal, Bart Selman - 2008
160 Improvements To Propositional Satisfiability Search Algorithms – Jon William Freeman - 1995
113 Finding Hard Instances of the Satisfiability Problem: A Survey – Stephen A. Cook, David G. Mitchell - 1997
98 Generating Hard Satisfiability Problems – Bart Selman, David Mitchell, Hector Levesque - 1996
5 Incomplete Algorithms – Henry Kautz, Ashish Sabharwal, Bart Selman - 2008
2 A History of Satisfiability – John Franco, John Martin - 2009
48 Intelligent Backtracking On Constraint Satisfaction Problems: Experimental And Theoretical Results – Andrew B. Baker - 1995
58 The SAT Phase Transition – Ian P. Gent, Toby Walsh - 1994
The SAT Phase Transition – Ian P. Gentand, Toby Walsh
24 The scaling window of the 2-sat transition – Béla Bollobás, Christian Borgs, Jennifer T. Chayes, Jeong Han Kim, David B. Wilson - 1999
19 Some Pitfalls for Experimenters with Random SAT – David G. Mitchell, Hector J. Levesque - 1996
29 Random 3-SAT: The Plot Thickens – Cristian Coarfa , Demetrios D. Demopoulos, Alfonso San Miguel, Devika Subramanian, Moshe Y. Vardi - 2000
359 GSAT and Dynamic Backtracking – Matthew L. Ginsberg, David A. McAllester - 1994
7 Improving Backtrack Search for SAT by Means of Redundancy – Laure Brisoux, Éric Grégoire, Lakhdar Saïs - 1999
19 Statistical mechanics of combinatorial search – Tad Hogg - 1994
23 The Hardest Random SAT Problems – Ian P. Gent, Toby Walsh - 1994
Probabilistic Analysis of Satisfiability Algorithms – John Franco - 2008
78 Easy Problems are Sometimes Hard – Ian Gent, Toby Walsh - 1994