]. D. Ach00 and . Achlioptas, Setting 2 variables at a time yields a new lower bound for random 3-sat, Proceedings of the 32nd ACM Symposium on Theory of Computing, pp.28-37, 2000.

]. D. Bay05 and . Bayley, Phase transitions for generalized sat problems: upper bounds and experiments, 2005.

]. N. Cd04a, H. Creignou, and . Daudé, Coarse and sharp transitions for random generalized satisfiability problems, Proceedings of the third colloquium on mathematics and computer science, Vienna (Austria), pp.507-516, 2004.

]. N. Cd04b, H. Creignou, and . Daudé, Combinatorial sharpness criterion and phase transition classification for random csps, Information and Computation, vol.190, issue.2, pp.220-238, 2004.

M. T. Chao and J. Franco, Probabilistic analysis of a generalization of the unit-clause selection heuristics for the k-satisfiability problem, Information Science, vol.51, issue.3, pp.289-314, 1990.

S. [. Creignou, M. Khanna, and . Sudan, Complexity classifications of Boolean constraint satisfaction problems, SIAM Monographs on discrete mathematics and applications, 2001.
DOI : 10.1137/1.9780898718546

B. [. Chvátal and . Reed, Mick gets some (the odds are on his side), Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (FOCS'92), pp.620-627, 1992.

O. Dubois and Y. Boufkhad, A General Upper Bound for the Satisfiability Threshold of Randomr-SAT Formulae, Journal of Algorithms, vol.24, issue.2, pp.395-420, 1997.
DOI : 10.1006/jagm.1997.0867

O. Dubois, Y. Boufkhad, and J. Mandler, Typical random 3-sat formulae and the satisfiability threshold, Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms, pp.721-722, 2000.

J. [. Dubois and . Mandler, The 3-xor-sat threshold, Proceedings 43rd Symposium on Foundations of Computer Science, pp.769-778, 2002.

J. Franco and M. Paull, Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem, Discrete Applied Mathematics, vol.5, issue.1, pp.77-87, 1983.
DOI : 10.1016/0166-218X(83)90017-3

S. [. Frieze and . Suen, Analysis of Two Simple Heuristics on a Random Instance ofk-sat, Journal of Algorithms, vol.20, issue.2, pp.312-355, 1996.
DOI : 10.1006/jagm.1996.0016

]. A. Goe96 and . Goerdt, A threshold for unsatisfiability, Journal of of Computer and System Sciences, vol.53, issue.3, pp.469-486, 1996.

Y. [. Janson, M. Stamatiou, and . Vamvakari, Bounding the unsatisfiability threshold of random 3-sat. Random Structures and Algorithms, Erratum , Random Structures and Algorithms, vol.17, issue.181, pp.79-10299, 2000.

E. [. Kirousis, D. Kranakis, Y. C. Krizanc, and . Stamatiou, Approximating the unsatisfiability threshold of random formulas. Random Structures and Algorithms, pp.253-269, 1998.

]. A. Mdlv95, W. Maftouhi, L. Fernandez-de, and . Vega, On random 3-sat, Combinatorics, Probability and Computing, vol.4, issue.3, pp.189-195, 1995.

]. M. Mol03 and . Molloy, Models for random constraint satisfaction problems, SIAM Journal on Computing, vol.32, issue.4, pp.935-949, 2003.

B. [. Mitchell, H. J. Selman, and . Levesque, Hard and easy distributions of sat problems, Proceedings 10th National Conference on Artificial Intelligence, pp.459-465, 1992.

]. T. Sch78 and . Schaefer, The complexity of satisfiability problems, Proceedings 10th STOC, pp.216-226, 1978.

]. N. Tem93 and . Temme, Asymptotic estimates of stirling numbers, Stud. appl. Math, vol.89, pp.223-243, 1993.