1. Calabro C, Impagliazzo R, Paturi R (2006) A duality between clause width and clause density for SAT. In: Proceedings of the 21st annual IEEE conference on computational complexity (CCC 2006), Prague. IEEE Computer Society, pp 252–260
2. Cook SA (2006) The complexity of theorem proving procedures. In: Proceedings of the third annual ACM symposium on theory of computing, Shaker Heights, May 1971. ACM, pp 151–158
3. Dantsin E, Hirsch EA (2008) Worst-case upper bounds. In: Biere A, van Maaren H, Walsh T (eds) Handbook of satisfiability. IOS. In: Biere A, Heule MJH, van Maaren H, Walsh T (eds) Handbook of satisfiability. Frontiers in artificial intelligence and applications, vol 185. IOS Press, Amsterdam/Washington, DC, p 980. ISBN:978-1-58603-929-5, ISSN:0922-6389
4. Dantsin E, Goerdt A, Hirsch EA, Kannan R, Kleinberg J, Papadimitriou C, Raghavan P, Schöning U (2002) A deterministic ( 2 − 2 ∕ ( k + 1 ) ) n $$(2 - 2/(k + 1))^{n}$$ algorithm for k-SAT based on local search. Theor Comput Sci 289(1):69–83
5. Dantsin E, Hirsch EA, Wolpert A (2006) Clause shortening combined with pruning yields a new upper bound for deterministic SAT algorithms. In: Proceedings of CIAC-2006, Rome. Lecture notes in computer science, vol 3998. Springer, Berlin, pp 60–68