On the Threshold
暂无分享，去创建一个
[1] Jonathan S. Turner,et al. Almost All k-Colorable Graphs are Easy to Color , 1988, J. Algorithms.
[2] G. Kalai,et al. Every monotone graph property has a sharp threshold , 1996 .
[3] Riccardo Zecchina,et al. Coloring random graphs , 2002, Physical review letters.
[4] M. Mézard,et al. Analytic and Algorithmic Solution of Random Satisfiability Problems , 2002, Science.
[5] M. Mézard,et al. Spin Glass Theory and Beyond , 1987 .
[6] M. Mézard,et al. Survey propagation: An algorithm for satisfiability , 2005 .
[7] Rémi Monasson,et al. Statistical mechanics methods and phase transitions in optimization problems , 2001, Theor. Comput. Sci..
[8] B. Bollobás. The evolution of random graphs , 1984 .
[9] Toby Walsh,et al. Satisfiability in the Year 2000 , 2004, Journal of Automated Reasoning.
[10] Peter C. Cheeseman,et al. Where the Really Hard Problems Are , 1991, IJCAI.
[11] R. Zecchina,et al. Phase transitions in combinatorial problems , 2001 .
[12] M. Mézard,et al. The Cavity Method at Zero Temperature , 2002, cond-mat/0207121.