D. Achlioptas, L. M. Kirousis, E. Kranakis, D. Krizanc, M. S. Molloy et al., Random constraint satisfaction: A more accurate picture, Principles and Practice of Constraint Programming, pp.107-120, 1997.
DOI : 10.1007/BFb0017433

H. Chen, C. Gomes, and B. Selman, Formal Models of Heavy-Tailed Behavior in Combinatorial Search, Proc. of 7th Int. Conf. of Constraint Programming CP 2001, pp.408-422, 2001.
DOI : 10.1007/3-540-45578-7_28

I. Gent, E. Macintyre, P. Prosser, B. Smith, and T. Walsh, Random constraint satisfaction: flaws and structure, Constraints, pp.345-372, 2001.

I. Gent and T. Walsh, Easy problems are sometimes hard, Artificial Intelligence, vol.70, issue.1-2, pp.335-345, 1993.
DOI : 10.1016/0004-3702(94)90109-0

URL : http://dream.dai.ed.ac.uk/publications/pre-96/rp642.ps.gz

C. P. Gomes, B. Selman, and N. Crato, Heavy-tailed distributions in combinatorial search, Proc. of the 3rd Int. Conf. of Constraint Programming (CP-97), pp.121-135, 1997.
DOI : 10.1007/BFb0017434

C. P. Gomes, B. Selman, N. Crato, and H. Kautz, Heavy-tailed phenomena in satisfiability and constraint satisfaction problems, Journal of Automated Reasoning, vol.24, issue.1/2, pp.67-100, 2000.
DOI : 10.1023/A:1006314320276

T. Hogg, B. Huberman, and C. Williams, Phase transitions and the search problem, Artificial Intelligence, vol.81, issue.1-2, pp.1-15, 1996.
DOI : 10.1016/0004-3702(95)00044-5

C. M. Li and A. , Heuristics based on unit propagation for satisfiability problems, IJCAI (1), pp.366-371, 1997.

D. Mitchell, B. Selman, and H. Levesque, Hard and easy distributions of SAT problems, Proceedings of The Tenth National Conference on Artificial Intelligence, pp.459-465, 1992.

R. Resnick, Heavy tail modeling and teletraffic data: special invited paper, The Annals of Statistics, vol.25, issue.5, pp.1805-1869, 1997.
DOI : 10.1214/aos/1069362376

URL : http://doi.org/10.1214/aos/1069362376

B. Smith and S. Grant, Sparse constraint graphs and exceptionally hard problems, Proceedings of the International Joint Conference on Artificial Intelligence, pp.646-651, 1995.
DOI : 10.1007/bfb0017439

R. Williams, C. Gomes, and B. Selman, Backdoors to typical case complexity, Proceedings of the International Joint Conference on Artificial Intelligence, 2003.

K. Xu and W. Li, Exact phase transition in random constraint satisfaction problems, Journal of Artificial Intelligence Research, vol.12, pp.93-103, 2000.