arXiv Analytics

Sign in

arXiv:cond-mat/0401237AbstractReferencesReviewsResources

Message passing in random satisfiability problems

Marc Mezard

Published 2004-01-14Version 1

This talk surveys the recent development of message passing procedures for solving constraint satisfaction problems. The cavity method from statistical physics provides a generalization of the belief propagation strategy that is able to deal with the clustering of solutions in these problems. It allows to derive analytic results on their phase diagrams, and offers a new algorithmic framework.

Related articles:
arXiv:cond-mat/0507231 (Published 2005-07-11, updated 2006-04-23)
Spanning Trees in Random Satisfiability Problems
arXiv:cond-mat/0111153 (Published 2001-11-09, updated 2002-03-27)
Hiding solutions in random satisfiability problems: A statistical mechanics approach
arXiv:cond-mat/9907343 (Published 1999-07-22, updated 1999-11-15)
A variational description of the ground state structure in random satisfiability problems