Random Planted 3-SAT
Reference10 articles.
1. Alon N, Kahale N (1997) A spectral technique for coloring random 3-colorable graphs. SIAM J Comput 26(6):1733–1748 2. Barthel W, Hartmann AK, Leone M, Ricci-Tersenghi F, Weigt M, Zecchina R (2002) Hiding solutions in random satisfiability problems: a statistical mechanics approach. Phys Rev Lett 88:188701 3. Chen H, Frieze AM (1996) Coloring bipartite hypergraphs. In: Cunningham HC, McCormick ST, Queyranne M (eds) Integer programming and combinatorial optimization, 5th international IPCO conference, Vancouver, 3–5 June 1996. Lecture notes in computer science, vol 1084. Springer, pp 345–358 4. Cook S (1971) The complexity of theorem-proving procedures. In: Proceedings of the 3rd annual symposium on theory of computing, Shaker Heights, 3–5 May, pp 151–158 5. Feige U, Mossel E, Vilenchik D (2006) Complete convergence of message passing algorithms for some satisfiability problems. In: Díaz J, Jansen K, Rolim JDP, Zwick U (eds) Approximation, randomization, and combinatorial optimization. Algorithms and techniques, 9th international workshop on approximation algorithms for combinatorial optimization problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, 28–30 Aug 2006. Lecture notes in computer science, vol 4110. Springer, pp 339–350
|
|