A General Upper Bound for the Satisfiability Threshold of Random r-SAT Formulae

Journal of Algorithms

Volumn 24, Issue 2, 1997, Pages 395-420

  Dubois, O ^a   Boufkhad, Y ^a  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001691345     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1997.0867     Document Type: Article

References (21)

1. E. Boros, Y. Crama, P. L. Hammer, and M. Saks, A complexity index for satisfiability problems, SIAM J. Comput. (1994), 45-49.
2. Y. Boufkhad and O. Dubois, Length of prime implicants and number of solutions of random CNF formulae, [submitted]
3. A. Z. Broder, A. M. Frieze, and E. Upfal, On the satisfiability and maximum satisfiability of random 3-CNF formulas, in "Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, SODA 1993."
4. M. Chao and J. Franco, Probabilistic analysis of two heuristics for the 3-satisfiability problem, SIAM J. Comput. 15 (1986), 1106-1118.
5. V. Chvátal and B. Reed, Micks gets some (the odds are on his side), in "Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, SODA 1992," pp. 620-627.
6. J. Crawford and L. Auton, Experimental results on the crossover point in random 3SAT, Artificial Intelligence (1996).
7. O. Dubois, P. Andre, Y. Boufkhad, and J. Carlier, SAT versus UNSAT, in "Second DIMACS Challenge" (D. S. Johnson and M. A. Trick, Eds.), pp. 415-436, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AMS, 1993.
8. O. Dubois and Y. Boufkhad, From very hard doubly balanced SAT formulae to easy unbalanced SAT formulae, variations of the satisfiability threshold, in "Proceedings of the DIMACS workshop on the Satisfiability Problem: Theory and Applications" (J. G. Ding-Zhu Du and P. Pardalos, Eds.), Mar. 1996.
9. O. Dubois and Y. Boufkhad, Restrictive structures for characterizing the satisfiability, in "Fourth Int. Symposium on Artificial Intelligence and Mathematics, Jan. 1996."
10. O. Dubois and J. Carlier, Sur le Problème de Satisfiabilité, workshop, Barbizon, Oct. 1991.
11. A. El Maftouhi and W. Fernandez de la Vega, On random 3-SAT. [to appear]
12. J. Franco, On the probabilistic performance of algorithms for the Satisfiability Problem, Inform. Process. Lett. 23 (1986), 103-106.
13. A. Frieze and S. Suen, Analysis of two simple heuristics on a random instance of k-SAT, J. Algorithms.
14. A. Goerdt, A threshold for unsatisfiability, in "Mathematical Foundations of Computer Science" (H. I. M. and K. V., Eds.), pp. 264-274, Prague, Aug. 1992.
15. A. Goldberg, P. W. Purdom, and C. A. Brown, Average time analyses of simplified Davis-Putnam procedures, Inform. Process. Lett. 15 (1982), 72-75.
16. A. Kamath, R. Motwani, K. Palem, and P. Spirakis, Tail bounds for occupancy and the satisfiability threshold conjecture, in "Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, 1994," pp. 592-603.
17. L. M. Kirousis, E. Kranakis, and D. Krizanc, Approximating the unsatisfiability threshold of random formulas, DIMACS workshop on the Satisfiability, 1996.
18. L. M. Kirousis, E. Kranakis, and D. Krizanc, Approximating the unsatisfiability threshold of random formulas, ESA, 1996.
19. T. Larrabee and Y. Tsuji, Evidence for a satisfiability threshold for random 3CNF formulas, in "Proc. of Spring Symposium on A.I. and NP-Hard Problems" (H. e. Hirsh, Ed.), pp. 112-118, Stanford, CA, 1993.
20. D. Mitchell, B. Selman, and H. J. Levesque, Hard and easy distributions of sat problems, in "Proc. of the Tenth National Conference on Artificial Intelligence, San Jose, CA, July, AAAI 1992," pp. 459-465.
21. N. M. Temme, Asymptotic estimates of stirling numbers, Stud. Appl. Math. 89 (1993), 223-243.