Abstract
In this note I will review some of the recent results that have been obtained in the probabilistic approach to the random satisfiability problem. At the present moment the results are only heuristic. In the case of the random 3-satisfiability problem a phase transition from the satisfiable to the unsatisfiable phase is found at α=4.267. There are other values of α that separates different regimes and they will be described in details. In this context the properties of the survey decimation algorithm will also be discussed.
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.
References
Mézard, M., Parisi, G., Zecchina, R.: Science 297, 812 (2002)
Mézard, M., Zecchina, R.: The random K-satisfiability problem: from an analytic solution to an efficient algorithm cond-mat 0207194
Cook, S.A., Mitchell, D.G.: Finding Hard Instances of the Satisfiability Problem: A Survey. In: Du, Gu, Pardalos (eds.) Satisfiability Problem: Theory and Applications. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 35 (1997)
Kirkpatrick, S., Selman, B.: Critical Behaviour in the satisfiability of random Boolean expressions. Science 264, 1297 (1994)
Biroli, G., Monasson, R., Weigt, M.: A Variational description of the ground state structure in random satisfiability problems. Euro. Phys. J. B14, 551 (2000)
Dubois, O., Monasson, R., Selman, B., Zecchina, R. (eds.) Phase Transitions in Combinatorial Problems. Theoret. Comp. Sci. 265 (2001), Biroli, G., Cocco, S., Monasson, R.: Physica A 306, 381 (2002)
Mézard, M., Parisi, G., Virasoro, M.A.: Spin Glass Theory and Beyond. World Scientific, Singapore (1987)
Thouless, D.J., Anderson, P.A., Palmer, R.G.: Solution of a ‘solvable’ model. Phil. Mag. 35, 593 (1977)
Yedidia, J.S., Freeman, W.T., Weiss, Y.: Generalized Belief Propagation. In: Leen, T.K., Dietterich, T.G., Tresp, V. (eds.) Advances in Neural Information Processing Systems 13, pp. 689–695. MIT Press, Cambridge (2001)
Kschischang, F.R., Frey, B.J., Loeliger, H.-A.: Factor Graphs and the Sum-Product Algorithm. IEEE Trans. Infor. Theory 47, 498 (2002)
Monasson, R., Zecchina, R.: Entropy of the K-satisfiability problem. Phys. Rev. Lett. 76, 3881–3885 (1996)
Mulet, R., Pagnani, A., Weigt, M., Zecchina, R.: Phys. Rev. Lett. 89, 268701 (2002)
De Dominicis, C., Goldschmidt, Y.Y.: Replica symmetry breaking in finite connectivity systems: a large connectivity expansion at finite and zero temperature. J. Phys. A. Math. Gen. 22, 775 (1989)
Mézard, M., Parisi, G.: Eur. Phys. J. B 20, 217 (2001)
Mézard, M., Parisi, G.: The cavity method at zero temperature. condmat/ 0207121 (2002) (to appear in J. Stat. Phys.)
Dubois, O., Boufkhad, Y., Mandler, J.: Typical random 3-SAT formulae and the satisfiability threshold. In: Proc. 11th ACM-SIAM Symp. on Discrete Algorithms, San Francisco, CA, vol. 124 (2000)
Franz, S., Leone, M.: Replica bounds for optimization problems and diluted spin systems, cond-mat/0208280
Parisi, G.: Glasses, replicas and all that cond-mat/0301157 (2003)
Cocco, S., Dubois, O., Mandler, J., Monasson, R.: Phys. Rev. Lett. 90, 047205 (2003)
Talagrand, M.: Rigorous low temperature results for the p-spin mean field spin glass model. Prob. Theory and Related Fields 117, 303–360 (2000)
Dubois, O., Mandler, J.: In: FOCS 2002, 769 (2002)
Aldous, D.: The zeta(2) Limit in the Random Assignment Problem. Random Structures and Algorithms 18, 381–418 (2001)
Parisi, G.: cs.CC/0212047 On local equilibrium equations for clustering states (2002)
Parisi, G.: cs.CC/0212009 On the survey-propagation equations for the random Ksatisfiability problem (2002)
Braustein, A., Mezard, M., Weigt, M., Zecchina, R.: cond-mat/0212451 Constraint Satisfaction by Survey Propagation (2002)
Braunstein, A., Mezard, M., Zecchina, R.: cs.CC/0212002 Survey propagation: an algorithm for satisfiability (2002)
Parisi, G.: cs.CC/0301015 Some remarks on the survey decimation algorithm for K-satisfiability (2003)
Talagrand, M.: private communication (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Parisi, G. (2004). On the Probabilistic Approach to the Random Satisfiability Problem. In: Giunchiglia, E., Tacchella, A. (eds) Theory and Applications of Satisfiability Testing. SAT 2003. Lecture Notes in Computer Science, vol 2919. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24605-3_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-24605-3_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20851-8
Online ISBN: 978-3-540-24605-3
eBook Packages: Springer Book Archive