Exhaustive enumeration unveils clustering and freezing in random 3-SAT

We study geometrical properties of the complete set of solutions of the random 3-satisfiability problem. We show that even for moderate system sizes the number of clusters corresponds surprisingly well with the theoretic asymptotic prediction. We locate the freezing transition in the space of soluti...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2008-04
Hauptverfasser:	Ardelius, John, Zdeborová, Lenka
Format:	Artikel
Sprache:	eng
Schlagworte:	Clustering Computer Science - Computational Complexity Computer Science - Data Structures and Algorithms Enumeration Freezing Physics - Disordered Systems and Neural Networks Physics - Statistical Mechanics
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!