Author:
Zhao Yang,Jiang Jingfei,Wu Pengbo
Publisher
Springer International Publishing
Reference18 articles.
1. Achlioptas, D., Moore, C.: Random k-SAT: two moments suffice to cross a sharp threshold. SIAM J. Comput. 36(3), 740–762 (2006)
2. Braunstein, A., Mézard, M., Weigt, M., Zecchina, R.: Constraint satisfaction by survey propagation. In: Computational Complexity and Statistical Physics, p. 107 (2005)
3. Braunstein, A., Mézard, M., Zecchina, R.: Survey propagation: an algorithm for satisfiability. Random Struct. Algorithms 27(2), 201–226 (2005)
4. Braunstein, A., Zecchina, R.: Survey propagation as local equilibrium equations. J. Stat. Mech. Theory Exp. 2004(06), P06007 (2004)
5. Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the Third Annual ACM Symposium on Theory of Computing, pp. 151–158. ACM (1971)