1. V. Dahllöf, P. Jonsson, R. Beigel, Algorithms for four variants of the exact satisfiability problem, Theoret. Comput. Sci. 320 (2–3) (2004) 373–394.
2. Faster exact solutions for some NP-hard problems;Drori;Theoret. Comput. Sci.,2002
3. An upper bound O(20.16254n) for exact 3-satisfiability;Kulikov;Zapiski nauchnyh seminarov POMI,2002
4. O. Kullmann, H. Luckhardt, Algorithms for SAT/TAUT decision based on various measures, available at http://cs-svr1.swan.ac.uk/∼csoliver/papers.html (1998).
5. B. Monien, E. Speckenmeyer, O. Vornberger, Upper bounds for covering problems, Bericht 7, Universität Paderborn (1980).