activity
19962005
most citedClustering of solutions in the random satisfiability problem

222 citations · 446 across the 5 of their papers we have counts for

collaborators

8 papers

cond-mat.dis-nn200518 cited

Message passing algorithms for non-linear nodes and data compression

S. Ciliberti, M. Mezard, R. Zecchina

The use of parity-check gates in information theory has proved to be very efficient. In particular, error correcting codes based on parity checks over low-density graphs show excel…

cond-mat.dis-nn2005222 cited

Clustering of solutions in the random satisfiability problem

M. Mezard, T. Mora, R. Zecchina

Using elementary rigorous methods we prove the existence of a clustered phase in the random -SAT problem, for . In this phase the solutions are grouped into clusters wh…

cs.CC20035 cited

Threshold values of Random K-SAT from the cavity method

Stephan Mertens, Marc Mezard, Riccardo Zecchina

Using the cavity equations of \cite{mezard:parisi:zecchina:02,mezard:zecchina:02}, we derive the various threshold values for the number of clauses per variable of the random -s…

cs.CC2002186 cited

Survey propagation: an algorithm for satisfiability

A. Braunstein, M. Mezard, R. Zecchina

We study the satisfiability of randomly generated formulas formed by clauses of exactly literals over Boolean variables. For a given value of the problem is known t…

cond-mat.dis-nn200215 cited

Alternative solutions to diluted p-spin models and XORSAT problems

M. Mezard, F. Ricci-Tersenghi, R. Zecchina

We derive analytical solutions for p-spin models with finite connectivity at zero temperature. These models are the statistical mechanics equivalent of p-XORSAT problems in theoret…

cond-mat.stat-mech2001

Statistical mechanics methods and phase transitions in optimization problems

O. C. Martin, R. Monasson, R. Zecchina

Recently, it has been recognized that phase transitions play an important role in the probabilistic analysis of combinatorial optimization problems. However, there are in fact many…