Random 2-SAT: Results and problems

Theoretical Computer Science

Volumn 265, Issue 1-2, 2001, Pages 131-146

  Fernandez de la Vega, W ^a  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

Author keywords

Phase transition; Random 2 CNF formulas; Satisfiability

Indexed keywords

ASYMPTOTIC STABILITY; COMPUTER SCIENCE; CRITICAL PATH ANALYSIS; PROBABILISTIC LOGICS; STATISTICAL MECHANICS; THEOREM PROVING;

LOGICAL VARIABLES;

PROBLEM SOLVING;

EID: 0034886590     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00156-6     Document Type: Article

References (31)

1. Setting two variables at a time yields a new lower bound for random 3-SAT
2. Rigorous results for (2+p)-SAT this volume
3. A linear time algorithm for testing the truth of certain quantified Boolean formulas
4. Weighted sums of certain dependent random variables
5. Critical exponents of the 2-SAT transition
6. The scaling window of the 2-SAT transition
7. Uniform boundedness of critical crossing probabilities implies hyperscaling
8. Length of prime implicants and number of solutions of random CNF formulae
9. Probabilistic analysis of two heuristics for the 3-satisfiability problem
10. Mick Gets Some (the Odds are on its Side)
11. A general upper bound for the satisfiability threshold of a random k-SAT formula
12. Typical random 3-SAT formulae and the satisfiability threshold
13. On the complexity of timetable and multicommodity flow problems
14. Probabilistic analysis of the Davis-Putnam procedure for solving the satisfiability problem
15. Analysis of two simple heuristics for a random instance of K-SAT
16. A threshold for satisfiability
17. A threshold for satisfiability
18. Probability inequalities for sums of bounded random variables
19. The entropy of the K-satisfiability problem
20. Tricritical points in random combinatorics: The (2+p)-SAT case
21. Statistical mechanics of the random K-SAT model
22. Random 2-SAT and unsatisfiability