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

Documents Related by Co-Citation

737 A Machine program for theorem proving – G Logemann M Davis, D Loveland
679 A New Method for Solving Hard Satisfiability Problems – Bart Selman, Hector Levesque, David Mitchell - 1992
3 Experimental Results on the Cross over Point in Satisfiability Problems – J M Crawford, L D Auton - 1993
1 Kanefsky and W.M. Taylor.Where the Really Hard Problems Are – P Cheeseman, B - 1991
37 Performance tests of local search algorithms using new types of random cnf formulas – Byungki Cha, Kazuo Iwama - 1995
215 Domain-Independent Extensions to GSAT: Solving Large Structured Satisfiability Problems – Bart Selman, Henry Kautz - 1993
210 Many hard examples for resolution – V Chvátal, E Szemerédi - 1988
282 and easy distributions of SAT problems – Hard - 1992
194 The breakout method for escaping from local minima – P Morris - 1993
360 Noise strategies for improving local search – Bart Selman, Henry A. Kautz, Bram Cohen - 1994
18 Easy to be hard: Difficult problems for greedy algorithms – K Konolige - 1994
1 From very hard doubly balanced SAT formulae to easy unbalanced SAT formulae, variations of the satisfiability threshold – O Dubois, Y Boufkhad - 1996
3 Random Generation of Satisfiable and Unsatisfiable CNF Predicates – K Iwama, H Abeta, E Miyano - 1992
2 Some ideas on random generation of k-SAT instances – Richard Genisson, Lakhdar Sais - 1994
10 Resolution search – V Chvátal - 1997
47 Intelligent Backtracking On Constraint Satisfaction Problems: Experimental And Theoretical Results – Andrew B. Baker - 1995
6 Detecting logical inconsistencies – Bertrand MAZURE, Lakhdar SAIS, Eric GREGOIRE - 1996
201 Experimental Results on the Crossover Point in Satisfiability Problems – James M. Crawford, Larry D. Auton - 1993
1073 A computing procedure for quantification theory – M Davis, H Putnam - 1960