Survey and Belief Propagation on Random K-SAT
暂无分享,去创建一个
[1] E. Friedgut,et al. Sharp thresholds of graph properties, and the -sat problem , 1999 .
[2] Riccardo Zecchina,et al. Survey propagation: An algorithm for satisfiability , 2002, Random Struct. Algorithms.
[3] M. Mézard,et al. Two Solutions to Diluted p-Spin Models and XORSAT Problems , 2003 .
[4] M. Mézard,et al. Analytic and Algorithmic Solution of Random Satisfiability Problems , 2002, Science.
[5] Rémi Monasson,et al. Determining computational complexity from characteristic ‘phase transitions’ , 1999, Nature.
[6] Michele Leone,et al. Replica Bounds for Optimization Problems and Diluted Spin Systems , 2002 .
[7] Giorgio Parisi,et al. On the survey-propagation equations for the random K-satisfiability problem , 2002, ArXiv.
[8] Giorgio Parisi,et al. SK Model: The Replica Solution without Replicas , 1986 .
[9] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[10] R. Kikuchi. A Theory of Cooperative Phenomena , 1951 .
[11] R. Zecchina,et al. Phase transitions in combinatorial problems , 2001 .
[12] Rome,et al. The infinite volume limit in generalized mean field disordered models , 2002 .
[13] F. Guerra,et al. The Thermodynamic Limit in Mean Field Spin Glass Models , 2002, cond-mat/0204280.
[14] Bart Selman,et al. Local search strategies for satisfiability testing , 1993, Cliques, Coloring, and Satisfiability.
[15] Pekka Orponen,et al. An efficient local search method for random 3-satisfiability , 2003, Electron. Notes Discret. Math..
[16] Michel Talagrand,et al. Rigorous low-temperature results for the mean field p-spins interaction model , 2000 .
[17] M. Mézard,et al. Random K-satisfiability problem: from an analytic solution to an efficient algorithm. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.
[18] W. Freeman,et al. Generalized Belief Propagation , 2000, NIPS.