论文信息 - Some remarks on the survey decimation algorithm for K-satisfiability

Some remarks on the survey decimation algorithm for K-satisfiability

In this note we study the convergence of the survey decimation algorithm. An analytic formula for the reduction of the complexity during the decimation is derived. The limit of the converge of the algorithm are estimated in the random case: interesting phenomena appear near the boundary of convergence.

Giorgio Parisi

[1] W. Freeman,et al. Generalized Belief Propagation , 2000, NIPS.

[2] Giorgio Parisi,et al. On local equilibrium equations for clustering states , 2002, ArXiv.

[3] Riccardo Zecchina,et al. Survey propagation: An algorithm for satisfiability , 2002, Random Struct. Algorithms.

[4] M. Mézard,et al. The Cavity Method at Zero Temperature , 2002, cond-mat/0207121.

[5] Brendan J. Frey,et al. Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.

[6] S Kirkpatrick,et al. Critical Behavior in the Satisfiability of Random Boolean Expressions , 1994, Science.

[7] Monasson,et al. Entropy of the K-satisfiability problem. , 1996, Physical review letters.

[8] Rémi Monasson,et al. THE EUROPEAN PHYSICAL JOURNAL B c○ EDP Sciences , 1999 .

[9] Olivier Dubois,et al. Typical random 3-SAT formulae and the satisfiability threshold , 2000, SODA '00.

[10] M. Mézard,et al. Spin Glass Theory and Beyond , 1987 .

[11] Giorgio Parisi,et al. On the survey-propagation equations for the random K-satisfiability problem , 2002, ArXiv.

[12] R. Zecchina,et al. Phase transitions in combinatorial problems , 2001 .