Abstract
Non-rigorous statistical mechanics ideas have inspired a message passing algorithm called Belief propagation guided decimation for finding satisfying assignments of random k-SAT instances. This algorithm can be viewed as an attempt at implementing a certain thought experiment that we call the decimation process. In this paper we identify a variety of phase transitions in the decimation process and link these phase transitions to the performance of the algorithm. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Coja-Oghlan, A., & Pachon-Pinzon, A. Y. (2011). The decimation process in random k-SAT. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6755 LNCS, pp. 305–316). https://doi.org/10.1007/978-3-642-22006-7_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
