  We introduce and study randomized sequential importance sampling algorithms
for estimating the number of perfect matchings in bipartite graphs. In
analyzing their performance, we establish various non-standard central limit
theorems. We expect our methods to be useful for other applied problems.
