1. Biere, A., Heule, M., Maaren, H., and Walsh, T., Handbook of Satisfiability, Amsterdam: IOS, 2009.
2. Cook, S. and Mitchell, D., Finding Hard Instances of the Satisfiability Problem: A Survey, DIMACS Ser. Discret Math. Theoret. Comput. Sci., Am. Math. Soc., 1997, vol. 35, pp. 1–17.
3. Beame, P., Karp, R., Pitassi, T., and Saks, M., On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas, 30th STOC, Dallas, May 1998, pp. 561–571.
4. Goldberg, A., On the Complexity of the Satisfiability Problem, Appl. Math. Comput., J. Am. Math. Soc., 1997, vol. 35, no. 1, pp. 1–17.
5. Mitchell, D., Selman, B., and Levesque, H., Hard and Easy Distribution of SAT Problem, Proc. Tenth National Conf. Artific. Intelligence (AAAI-92), San Jose, 1997, pp. 459–465.