论文信息 - A probabilistic analysis of randomly generated binary constraint satisfaction problems - 字舞流文

A probabilistic analysis of randomly generated binary constraint satisfaction problems

Martin E. Dyer | Alan M. Frieze | Michael Molloy | A. Frieze | M. Dyer | Michael Molloy

[1] Barbara M. Smith,et al. Constructing an asymptotic phase transition in random binary constraint satisfaction problems , 2001, Theor. Comput. Sci..

[2] Joel H. Spencer,et al. Sudden Emergence of a Giantk-Core in a Random Graph , 1996, J. Comb. Theory, Ser. B.

[3] Stuart C. Shapiro,et al. Encyclopedia of artificial intelligence, vols. 1 and 2 (2nd ed.) , 1992 .

[4] Andrzej Rucinski,et al. Random graphs , 2006, SODA.

[5] Alan K. Mackworth. Constraint Satisfaction , 1985 .

[6] Eugene C. Freuder. A Sufficient Condition for Backtrack-Free Search , 1982, JACM.

[7] Béla Bollobás,et al. A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..

[8] Edward A. Bender,et al. The Asymptotic Number of Labeled Graphs with Given Degree Sequences , 1978, J. Comb. Theory A.

[9] Patrick Henry Winston,et al. The psychology of computer vision , 1976, Pattern Recognit..

[10] David L. Waltz,et al. Understanding Line drawings of Scenes with Shadows , 1975 .