Catching the k-NAESAT threshold

Full Paper: Search Google Scholar
 
The best current estimates of the thresholds for the existence of solutions in random constraint satisfaction problems ('CSPs') mostly derive from the first and the second moment method. Yet apart from a very few exceptional cases these methods do not quite yield matching upper and lower bounds. According to deep but non-rigorous arguments from statistical mechanics, this discrepancy is due to a change in the geometry of the set of solutions called condensation that occurs shortly before the actual threshold for the existence of solutions (Krzakala, Montanari, Ricci-Tersenghi, Semerjian, Zdeborova: PNAS~2007). To cope with condensation, physicists have developed a sophisticated but non-rigorous formalism called Survey Propagation (Me-zard, Parisi, Zecchina: Science 2002).
 
Suggested Reading
v

Suggest a relevant paper:
Title *
Authors Pub year

 
 

Discussion


Post anonymously: (You can change the anonymity of a comment at any time.)

You must be logged in to comment. Log in


No comments yet.