222 citations · 279 across the 4 of their papers we have counts for
Showing 2005Show all
2 papers · 1 filter
cond-mat.dis-nn2005
Pairs of SAT Assignment in Random Boolean Formulae
Hervé Daudé, Marc Mezard, Thierry Mora +1
We investigate geometrical properties of the random K-satisfiability problem using the notion of x-satisfiability: a formula is x-satisfiable if there exist two SAT assignments dif…
cond-mat.dis-nn2005★ 222 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…