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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Achlioptas, D., Coja-Oghlan, A.: Algorithmic barriers from phase transitions. In: Proc. 49th FOCS, pp. 793–802 (2008)
Achlioptas, D., Coja-Oghlan, A., Ricci-Tersenghi, F.: On the solution space geometry of random formulas. Random Structures and Algorithms 38, 251–268 (2011)
Achlioptas, D., Moore, C.: Random k-SAT: two moments suffice to cross a sharp threshold. SIAM Journal on Computing 36, 740–762 (2006)
Achlioptas, D., Peres, Y.: The threshold for random k-SAT is 2k ln 2 − O(k). Journal of the AMS 17, 947–973 (2004)
Achlioptas, D., Ricci-Tersenghi, F.: Random formulas have frozen variables. SIAM J. Comput. 39, 260–280 (2009)
Braunstein, A., Mézard, M., Zecchina, R.: Survey propagation: an algorithm for satisfiability. Random Structures and Algorithms 27, 201–226 (2005)
Coja-Oghlan, A.: On belief propagation guided decimation for random k-SAT. In: Proc. 22nd SODA, pp. 957–966 (2011)
Daudé, H., Mézard, M., Mora, T., Zecchina, R.: Pairs of SAT-assignments in random Boolean formulae. Theoretical Computer Science 393, 260–279 (2008)
Frieze, A., Suen, S.: Analysis of two simple heuristics on a random instance of k-SAT. Journal of Algorithms 20, 312–355 (1996)
Kroc, L., Sabharwal, A., Selman, B.: Message-passing and local heuristics as decimation strategies for satisfiability. In: Proc. 24th SAC, pp. 1408–1414 (2009)
Krzakala, F., Montanari, A., Ricci-Tersenghi, F., Semerjian, G., Zdeborova, L.: Gibbs states and the set of solutions of random constraint satisfaction problems. Proc. National Academy of Sciences 104, 10318–10323 (2007)
Mertens, S., Mézard, M., Zecchina, R.: Threshold values of random K-SAT from the cavity method. Random Struct. Alg. 28, 340–373 (2006)
Mézard, M., Parisi, G., Zecchina, R.: Analytic and algorithmic solution of random satisfiability problems. Science 297, 812–815 (2002)
Mitchell, D., Selman, B., Levesque, H.: Hard and easy distribution of SAT problems. In: Proc. 10th AAAI, pp. 459–465 (1992)
Montanari, A., Ricci-Tersenghi, F., Semerjian, G.: Solving constraint satisfaction problems through Belief Propagation-guided decimation. In: Proc. 45th Allerton (2007)
Ricci-Tersenghi, F., Semerjian, G.: On the cavity method for decimated random constraint satisfaction problems and the analysis of belief propagation guided decimation algorithms. J. Stat. Mech., 09001 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Coja-Oghlan, A., Pachon-Pinzon, A.Y. (2011). The Decimation Process in Random k-SAT. In: Aceto, L., Henzinger, M., Sgall, J. (eds) Automata, Languages and Programming. ICALP 2011. Lecture Notes in Computer Science, vol 6755. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22006-7_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-22006-7_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22005-0
Online ISBN: 978-3-642-22006-7
eBook Packages: Computer ScienceComputer Science (R0)