Survey propagation: An algorithm for satisfiability

We study the satisfiability of randomly generated formulas formed by M clauses of exactly K literals over N Boolean variables. For a given value of N the problem is known to be most difficult when α = M/N is close to the experimental threshold αc separating the region where almost all formulas are S...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Random structures & algorithms 2005-09, Vol.27 (2), p.201-226
Hauptverfasser:	Braunstein, A., Mézard, M., Zecchina, R.
Format:	Artikel
Sprache:	eng
Schlagworte:	Computational Complexity Computer Science Condensed Matter Physics Statistical Mechanics
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!