Phys. Rev. E 78, 040101(R) (2008) [4 pages]Exhaustive enumeration unveils clustering and freezing in the random 3-satisfiability problem
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 solutions, which has been conjectured to be relevant in explaining the onset of computational hardness in random constraint satisfaction problems. © 2008 The American Physical Society URL:
http://link.aps.org/doi/10.1103/PhysRevE.78.040101
DOI:
10.1103/PhysRevE.78.040101
PACS:
05.40.−a, 89.20.Ff, 75.10.Nr, 89.70.Eg
|
|
About | Terms and Conditions | Subscriptions | Search | Help
Use of the American Physical Society websites and journals implies that the user has read and agrees to our Terms and Conditions and any applicable Subscription Agreement. Physical Review®, Physical Review Letters®, Reviews of Modern Physics®, and Physical Review Special Topics® are trademarks of the American Physical Society.