We apply the splitting method to three well-known counting problems, namely 3-SAT, random graphs with prescribed degrees, and binary contingency tables. We present an enhanced version of the splitting method based on the capture-recapture technique, and show by experiments the superiority of this technique for SAT problems in terms of variance of the associated estimators, and speed of the algorithms.
@article{arxiv.1103.6096,
title = {Counting with Combined Splitting and Capture-Recapture Methods},
author = {Paul Dupuis and Bahar Kaynar and Ad Ridder and Reuven Rubinstein and Radislav Vaisman},
journal= {arXiv preprint arXiv:1103.6096},
year = {2011}
}