1. S. Baumer, R. Schuler, Improving a probabilistic 3-SAT algorithm by dynamic search and independent clause pairs, Electronic Coll. on Computational Complexity, vol. 10, 2003, (ftp://ftp.eccc.uni-trier.de/pub/eccc/reports/2003/TR03-010/index.html).
2. R. Bayardo, J. D. Pehoushek, Counting models using connected components, Proc. 17th National Conf. AI and 12th Conf. on Innovative Applications of Artificial Intelligence, 2000, pp. 157–162.
3. R. Beigel, Finding maximum independent sets in sparse and general graphs, Proc. 10th ACM-SIAM Symp. on Discrete Algorithms, 1999, pp. 856–857.
4. R. Beigel, D. Eppstein, 3-coloring in time O(1.3289n), ACM Computing Research Repository, June 2000, cs.DS/0006046.
5. The good old Davis-Putnam procedure helps counting models;Birnbaum;J. Artif. Intell. Res.,1999