Exhaustive enumeration unveils clustering and freezing in random 3-SAT

Simple item page
dc.creatorArdelius, John
dc.creatorZdeborová, Lenka
dc.date2008-04-02
dc.date2008-04-14
dc.date.accessioned2026-07-07T10:06:31Z
dc.date.available2026-07-07T10:06:31Z
dc.descriptionWe 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 solutions which has been conjectured to be relevant in explaining the onset of computational hardness in random constraint satisfaction problems.
dc.description4 pages, 3 figures
dc.identifierhttps://arxiv.org/abs/0804.0362
dc.identifierhttp://arxiv.org/abs/0804.0362
dc.identifierPhys. Rev. E 78, 040101(R) (2008)
dc.identifierdoi:10.1103/PhysRevE.78.040101
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/170350
dc.subjectStatistical Mechanics
dc.subjectDisordered Systems and Neural Networks
dc.subjectComputational Complexity
dc.subjectData Structures and Algorithms
dc.titleExhaustive enumeration unveils clustering and freezing in random 3-SAT
dc.typetext

Files

Collections

arXiv