Improved results can be found in the following theses:
Vilhelm Dahllöf: Exact Algorithms for Exact Satisfiability
Magnus Wahlström: Algorithms, Measures, and Upper Bounds for Satisfiability and Related Problems