Computational science: Can get satisfaction
暂无分享,去创建一个
[1] S Kirkpatrick,et al. Critical Behavior in the Satisfiability of Random Boolean Expressions , 1994, Science.
[2] E. Friedgut,et al. Sharp thresholds of graph properties, and the -sat problem , 1999 .
[3] Rémi Monasson,et al. Determining computational complexity from characteristic ‘phase transitions’ , 1999, Nature.
[4] Assaf Naor,et al. Rigorous location of phase transitions in hard optimization problems , 2005, Nature.
[5] Tad Hogg,et al. Phase Transitions and the Search Problem , 1996, Artif. Intell..
[6] M. Mézard,et al. Analytic and Algorithmic Solution of Random Satisfiability Problems , 2002, Science.