1. Schaefer, T.J.: The Complexity of Satisfiability Problems. In: 10th Annual ACM Symposium on Theory of Computing, pp. 216–226 (1978)
2. Drori, L., Peleg, D.: Faster Exact Solutions for Some NP-hard Problems. Theoretical Computer Science 287(2), 473–499 (2002)
3. Porschen, S., Randerath, B., Speckenmeyer, E.: X3SAT is Decidable in time O(2
n/5). In: Fifth International Symposium on the Theory and Applications of Satisfiability Testing, pp. 231–235. Springer, Heidelberg (2002)
4. Porschen, S., Randerath, B., Speckenmeyer, E.: Exact 3-Satisfiability is Decidable in time O(20.16254n ) (June 2002) (manuscript)
5. Annals of Mathematics and Artificial Intelligence 43(1) 173-193 (2005)