Counting good truth assignments of random k-SAT formulae

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 1255-1264

  Montanari, Andrea ^a   Shah, Devavrat ^b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b CERAS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FORESTRY; POLYNOMIAL APPROXIMATION;

BELIEF PROPAGATION; DETERMINISTIC APPROXIMATION; GIBBS DISTRIBUTION; K-SATISFIABILITY; MARGINAL DISTRIBUTION; MARGINAL PROBABILITY; SATISFYING ASSIGNMENTS; TRUTH ASSIGNMENT;

APPROXIMATION ALGORITHMS;

EID: 40849130627     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. H. O. Georgii, "Gibbs Measures and Phase Transitions". Berlin, Walter de Gruyter and Co., 1988
2. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky, "Determining computational complexity from characteristic 'phase transitions' ", Nature 300 (1999), 133-137
3. M. Mézard, G. Parisi, and R. Zecchina, "Analytic and Algorithmic Solution of Random Satisfiability Problems", Science 297 (2002), 812-815
4. D. Achlioptas, A. Naor and Y. Peres, "Rigorous location of phase transitions in hard optimization problems", Nature 435 (2005), 759-764
5. M. Talagrand, " The high temperature case of the K-sat problem", Probability Theory and Related Fields 119, 2001, 187-212.
6. D. Achlioptas and Y. Peres, "The threshold for random k-SAT is 2k log 2-O(k)", Journal of the AMS, 17 (2004), 947-973.
7. R. Monasson and R. Zecchina, "Entropy of the K Satisfiability Problem", Phys. Rev. Lett. 76 (1996), 3881-3885
8. S. Franz and M. Leone, "Replica bounds for optimization problems and diluted spin systems", Journal of Statistical Physics, 111 (2003), 535.
9. S. Franz, M. Leone and F. L. Toninelli, "Replica bounds for diluted non-Poissonian spin systems", Journal of Physics, A 36 (2003) 10967.
10. M. Jerrum and A. Sinclair, "Polynomial-time Approximation Algorithms for the Ising Model", SIAM Journal on Computing 22 (1993), pp. 1087-1116.
11. D. Weitz, "Counting independent sets up to the tree threshold", In Proceedings of STOC, 2006.
12. A. Bandyopadhyay and D. Gamarnik, "Counting without sampling. New algorithms for enumeration problems using statistical physics", In Proceedings of SODA, 2006.
13. A. Montanari and D. Shah, "k-SAT: Counting Satisfying Assignment and Threshold for Correlation Decay", Longer version, in preparation.
14. E. Friedgut, "Sharp Thresholds of Graph Proprties, and the k-sat Problem", Journal of American Mathematical Society, 12 (1999), no. 4, 1017-1054.
15. J. Pearl, "Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference", San Francisco, CA: Morgan Kaufmann, 1988.
16. M. Wainwright and M. Jordan, "Graphical models, exponential families, and variational inference," Tech. Report, Dept. of Stat., University of Cal., Berkeley, 2003.
17. S. Tatikonda and M. Jordan, "Loopy Belief Propagation and Gibbs Measure," Berkeley Working Paper, 2002.