1. Lecture Notes in Computer Science;S Ermon,2010
2. Ermon, S., Gomes, C., Selman, B.: A flat histogram method for computing the density of states of combinatorial problems. In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, pp. 2608–2613 (2011)
3. Montanari, A., Shah, D.: Counting good truth assignments of random k-SAT formulae. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’07, pp. 1255–1264 (2007)
4. Mitchell, D., Selman, B., Levesque, H.: Hard and easy distributions of SAT problems. In: AAAI, vol. 92, pp. 459–465 (1992)
5. Hogg, T., Huberman, B.A., Williams, C.P.: Phase transitions and the search problem. Artif. Intell. 81(1), 1–15 (1996)