Upper bounds on the satisfiability threshold

Theoretical Computer Science

Volumn 265, Issue 1-2, 2001, Pages 187-197

  Dubois, Olivier ^a  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

Phase transition; SAT threshold; Satisfiability; Upper bounds

Indexed keywords

BOUNDARY CONDITIONS; COMBINATORIAL MATHEMATICS; FINITE AUTOMATA; MATHEMATICAL MODELS; PHASE TRANSITIONS; PROBABILISTIC LOGICS; PROBLEM SOLVING; RANDOM PROCESSES;

GAUSSIAN COEFFICIENTS;

THRESHOLD ELEMENTS;

EID: 0034888388     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00161-X     Document Type: Article

References (35)

1. Setting 2 variables at a time yields a new lower bound for random 3-SAT
2. Lower bounds for random 3-SAT via differential equations
3. The scaling window of the 2-SAT transition
4. Length of prime implicants and number of solutions of random CNF formulae
5. On the satisfiability and maximum satisfiability of random 3-CNF formulas
6. Probabilistic analysis of two heuristics for the 3-satisfiability problem
7. Probabilistic analysis of a generalization of the unit-clause litteral selection heuristics for the k-satisfiability problem
8. Micks gets some (the odds are on his side)
9. Many hard examples for resolution
10. Experimental results on the crossover point in random 3-SAT
11. SAT versus UNSAT
12. A general upper bound for the satisfiability threshold of random r-SAT formulae, algorithms seminar of October 1995
13. A general upper bound for the satisfiability threshold of random r-SAT formulae
14. Typical random 3-SAT formulae and the satisfiability threshold
15. On random 3-SAT
16. Results related to threshold phenomena research in satisfiability: Lower bounds
17. Probabilistic analysis of the Davis-Putnam procedure for solving the satisfiability problem
18. Necessary and sufficient conditions for sharp thresholds of graph properties and the k-SAT problem
19. Analysis of two simple heuristics on a random instance of the k-SAT problem
20. A threshold for unsatisfiability
21. A threshold for unsatisfiability
22. Bounding the unsatisfiability threshold of random 3-SAT
23. Tail bounds for occupancy and the satisfiability threshold conjecture
24. Tail bounds for occupancy and the satisfiability threshold conjecture
25. Approximating the unsatisfiability threshold of random formulas
26. Approximating the unsatisfiability threshold of random formulas
27. Approximating the unsatisfiability threshold of random formulae
28. Statistical mechanics of the random k-Sat problem
29. Computational complexity from 'characteristic' phase transitions
30. Hard and easy distribution of SAT problems
31. Restrictive structures for characterizing the satisfiability
32. Étude statistique de l' existence de solutions de problèmes SAT, application aux systèmes-experts