Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Achlioptas, D., Peres, Y.: The Threshold for Random k-SAT is 2^k ln2 - O(k). JAMS: Journal of the American Mathematical Society 17, 947–973 (2004)
2. Achlioptas, D., Ricci-Tersenghi, F.: On the solution-space geometry of random constraint satisfaction problems. In: STOC, pp. 130–139. ACM Press (2006)
3. Anbulagan: Dew Satz: Integration of Lookahead Saturation with Restrictions into Satz. In: SAT Competition, pp. 1–2 (2005)
4. Boufkhad, Y., Hugel, T.: Estimating satisfiability. Discrete Applied Mathematics 160(1-2), 61–80 (2012)
5. Braunstein, A., Mézard, M., Zecchina, R.: Survey propagation: An algorithm for satisfiability. Random Structures and Algorithms 27(2), 201–226 (2005)