Lower bounds for random 3-SAT via differential equations

Theoretical Computer Science

Volumn 265, Issue 1-2, 2001, Pages 159-185

  Achlioptas, Dimitris ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

Algorithms; Differential equations; Random 3 sat

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; BOUNDARY CONDITIONS; DIFFERENTIAL EQUATIONS; FUNCTION EVALUATION; NUMBER THEORY; PROBABILISTIC LOGICS; RANDOM PROCESSES;

CONJUNCTIVE NORMAL FORM (CNF) FORMULAS;

THRESHOLD ELEMENTS;

EID: 0034892310     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00159-1     Document Type: Article

References (31)

1. Setting two variables at a time yields a new lower bound for random 3-SAT
2. Two-coloring random hypergraphs
3. Rigorous results for random (2+p)-SAT
4. The analysis of a list-coloring algorithm on a random graph
5. Optimal policies for greedy 3-SAT algorithms
6. The asymptotic number of labeled graphs with given degree sequences
7. A variational description of the ground state structure in random satisfiability problems
8. A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
9. On the satisfiability and maximum satisfiability of random 3-CNF formulas
10. Probabilistic analysis of two heuristics for the 3-satisfiability problem
11. Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem
12. Mick gets some (the odds are on his side)
13. The complexity of theorem-proving procedures
14. Upper bounds to the unsatisfiability threshold of random 3-SAT formulas: Results and techniques
15. Results related to threshold phenomena research in satisfiability: Lower bounds
16. Probabilistic analysis of the Davis-Putnam procedure for solving the satisfiability problem
17. Sharp thresholds of graph properties, and the k-SAT problem
18. Analysis of two simple heuristics on a random instance of k-SAT
19. A threshold for unsatisfiability
20. Maximum matchings in sparse random graphs
21. Solutions of ordinary differential equations as limits of pure jump Markov processes
22. A critical point for random graphs with a given degree sequence
23. Phase transition and search cost in the (2+p)-SAT problem
24. Determining computational complexity from characteristic "phase transitions"
25. Differential equations for random processes and random graphs