The set of solutions of random XORSAT formulae

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2012, Pages 760-779

  Ibrahimi, Morteza ^a   Kanoria, Yashodhan ^a   Kraning, Matt ^a   Montanari, Andrea ^a,b  

^a Stanford University   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FORMAL LOGIC; ITERATIVE METHODS;

BOOLEAN VARIABLES; CLUSTERING THRESHOLD; EXPONENTIAL NUMBERS; ITERATIVE ALGORITHM; K-SATISFIABILITY; RANDOM INSTANCE; SATISFIABILITY; STRUCTURAL SIMILARITY;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84860181218     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973099.62     Document Type: Conference Paper

References (30)

1. D. Achlioptas and A. Coja-Oghlan. Algorithmic Barriers from Phase Transitions. In Proc. of the 49th IEEE Symposium on Foundations of Computer Science, FOCS, pages 793-802, 2008.
2. D. Achlioptas, A. Coja-Oghlan, and F. Ricci-Tersenghi. On the solution-space geometry of random constraint satisfaction problems. Rand. Struct. Alg., 38:251-268, 2011.
3. D. Achlioptas, A. Naor, and Y. Peres. Rigorous Location of Phase Transitions in Hard Optimization Problems. Nature, 435:759-764, 2005. (Pubitemid 40839720)
4. k log 2 - O(k). J. Amer. Math. Soc., 17:947-973, 2004.
5. D. Aldous and R. Lyons. Processes on Unimodular Random Networks. Elec. J. of Probab., 12:14541508, 2007.
6. D. Aldous and J. M. Steele. The Objective Method: Probabilistic Combinatorial Optimization and Local Weak Convergence. In H. Kesten, editor, Probability on discrete structures, pages 1-72. Springer Verlag, 2003.
7. d, Many Questions and a Few Answers. Elec. J. of Probab., 1:71-82, 1996.
8. B. Bollobás. A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. Eur. J. Combinatorics, 1:296-307, 1980.
9. B. Bollobás. Random graphs. Cambridge University Press, Cambridge, 2001.
10. S. Cocco, O. Dubois, J. Mandler, and R. Monasson. Rigorous Decimation-Based Construction of Ground Pure States for Spin-Glass Models on Random Lattices. Phys. Rev. Lett., 90:047205, 2003.
11. A. Coja-Oghlan. A better algorithm for random k-sat. SIAM Journal on Computing, 39:2823-2864, 2010.
12. A. Dembo and A. Montanari. Finite size scaling for the core of large random hypergraphs. Ann. Appl. Prob., 18:1993-2040, 2008.
13. A. Dembo and A. Montanari. Gibbs measures and phase transitions on sparse random graphs. Braz. J. Probab. Stat., 24:137-211, 2010.
14. M. Dietzfelbinger, A. Goerdt, M. Mitzenmacher, A. M. an R. Pagh, and M. Rink. Tight Thresholds for Cuckoo Hashing via XORSAT. In Proc. of the 37th International Colloquium on Automata, Languages and Programming, ICALP, pages 213-225, 2010.
15. O. Dubois and J. Mandler. The 3-XORSAT Threshold. In Proc. of the 43rd IEEE Symposium on Foundations of Computer Science, FOCS, pages 769-778, 2002.
16. E. Friedgut. Sharp thresholds of graph proprties, and the k-sat problem. J. Amer. Math. Soc., 12:1017-1054, 1999.
17. S. Hoory, N. Linial, and A. Widgerson. Expander graphs and their applications. Bull. Amer. Math. Soc., 43:438-561, 2006.
18. T. Kleinjung, K. Aoki, J. Franke, A. K. Lenstra, E. Thomé, J. W. Bos, P. Gaudry, A. Kruppa, P. L. Montgomery, D. A. Osvik, H. te Riele, A. Timofeev, and P. Zimmermann. Factorization of a 768-Bit RSA Modulus. In Advances in Cryptology CRYPTO 2010, pages 333-350, 2010.
19. F. Krzakala, A. Montanari, F. Ricci-Tersenghi, G. Semerjian, and L. Zdeborova. Gibbs states and the set of solutions of random constraint satisfaction problems. Proc. Natl. Acad. Sci., 104:10318-10323, 2007. (Pubitemid 47185663)
20. M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. A. Spielman. Analysis of low density codes and improved designs using irregular graphs. In Proc. of the 30th ACM Symposium on Theory of Computing, STOC, pages 249-258, 1998.
21. M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. A. Spielman. Efficient erasure correcting codes. IEEE Trans. Inform. Theory, 47(2):569-584, 2001. (Pubitemid 32318090)
22. M. K. A. M. M. Ibrahimi, Y. Kanoria. The set of solutions of random xorsat formulae. 2011. Eprint arXiv:1107.5377v1.
23. M. Mézard and A. Montanari. Information, Physics, and Computation. Oxford University Press, Oxford, 2009.
24. M. Mézard, G. Parisi, and R. Zecchina. Analytic and Algorithmic Solution of Random Satisfiability Problems. Science, 297:812-815, 2003.
25. M. Mézard, F. Ricci-Tersenghi, and R. Zecchina. Two solutions to diluted p-spin models and XORSAT problems. J. Stat. Phys., 111:505-533, 2003.
26. M. Molloy. Cores in random hypergraphs and boolean formulas. Rand. Struct. Alg., 27:124-135, 2005. (Pubitemid 41229043)
27. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky. Determining computational complexity from characteristic phase transitions. Nature, 400:133-137, 1999. (Pubitemid 29327535)
28. T. J. Richardson and R. Urbanke. Modern Coding Theory. Cambridge University Press, Cambridge, 2008.
29. N. C. Wormald. The asymptotic distribution of short cycles in random regular graphs. Journal of Combinatorial Theory, Series B, 31(2):168-182, 1981.
30. N. C. Wormald. Models of random regular graphs. In J. D. Lamb and D. A. Preece, editors, Surveys in Combinatorics, 1999, London Mathematical Society Lecture Note Series, pages 239-298. Cambridge University Press, 1999.