Random k-Sat: A Tight Threshold for Moderately Growing k

Combinatorica

Volumn 25, Issue 3, 2005, Pages 297-305

  Frieze, Alan ^a   Wormald, Nicholas C ^b,c  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b UNIVERSITY OF MELBOURNE   (Australia)

^c UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21244465059     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00493-005-0017-3     Document Type: Article

References (16)

1. D. ACHLIOPTAS: Setting two variables at a time yields a new lower bound for random 3-SAT, Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (2000), 28-37.
2. D. ACHLIOPTAS and G. SORKIN: Optimal myopic algorithms for random 3-SAT, Proceedings of the 41st Annual IEEE Symposium on Foundations of Computing (2000), 590-600.
3. B. BOLLOBÁS, C. BORGS, J. CHAYES, J. H. KIM and D. B. WILSON: The scaling window of the 2-SAT transition, Random Structures and Algorithms (2001), 201-256.
4. A. Z. BRODER, A. M. FRIEZE and E. UPFAL: On the satisfiability and maximum satisfiability of random 3-CNF formulas, Proceedings of the Fourth Annual ACMSIAM Symposium on Discrete Algorithms (1993), 322-330.
5. M. T. CHAO and J. FRANCO: Probabilistic analysis of two heuristics for the 3-satisfiability problem, SIAM Jornal on Computing 15 (1986), 1106-1118.
6. M. T. CHAO and J. FRANCO: Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k satisfiable problem, Information Science 51 (1990), 289-314.
7. V. CHVATÁL and B. REED: Mick gets some (the odds are on his side), Proceedings of the 33rd Annual IEEE Symposium on the Foundations of Computer Science (1992), 620-627.
8. O. DUBOIS, Y. BOUFKHAD and J. MANDLER: Typical random 3-SAT formulae and the satisfiability threshold, Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (2000), 126-127.
9. W. FERNANDEZ DE LA VEGA: On random 2-SAT, manuscript, 1992.
10. E. FRIEDGUT: Sharp thresholds of graph properties, and the k-sat problem. With an appendix by Jean Bourgain. Journal of the American Mathematical Society 12 (1999), 1017-1054.
11. A. M. FRIEZE and G. SORKIN: A note on random 2-SAT with prescribed literal degrees, to appear in SODA 2002.
12. A. M. FRIEZE and S. SUEN: Analysis of Two Simple Heuristics on a Random Instance of k-SAT, Journal of Algorithms 20 (1996), 312-355.
13. A. GOERDT: A threshold for unsatisfiability, Journal of Computer and System Sciences 33 (1996), 469-486.
14. S. JANSON, Y. STAMATIOU and M. VAMVAKARI: Bounding the unsatisfiability threshold of random 3-SAT, Random Structures Algorithms 17 (2000), 103-116.
15. L. M. KIROUSIS, E. KRANAKIS, D. KRIZANC and Y. C. STAMATIOU: Approximating the unsatisfiability threshold of random formulas, Random Structures and Algorithms 12 (1998), 253-269.
16. Y. VERHOEVEN: Random 2-SAT and unsatisfiability, Information Processing Letters 72 (1999), 119-123.