Author:
Abbe Emmanuel,Montanari Andrea
Publisher
Springer Berlin Heidelberg
Reference45 articles.
1. Abbe, E., Montanari, A.: On the concentration of the number of solutions of random satisfiability formulas. Random Structures & Algorithms (2013) ISSN: 1098-2418, http://dx.doi.org/10.1002/rsa.20501 , doi:10.1002/rsa.20501
2. Abbe, E., Montanari, A.: Conditional Random Fields, Planted Constraint Satisfaction, and Entropy Concentration. arXiv:1305.4274 [math.PR] (2013)
3. Achlioptas, D., Coja-Oghlan, A.: Algorithmic barriers from phase transitions. In: Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, pp. 793–802. IEEE Computer Society, Washington, DC (2008)
4. Krivelevich, M., Coja-Oghlan, A., Vilenchik, D.: Why almost all satisfiable k-cnf formulas are easy. In: Proceedings of the 13th International Conference on Analysis of Algorithms, pp. 89–102 (2007)
5. Achlioptas, D., Jia, H., Moore, C.: Hiding satisfying assignments: two are better than one. In: Proceedings of AAAI 2004, pp. 131–136 (2004)
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献