<p>We develop algorithms to approximately count perfect matchings in bipartite graphs (or permanents of the corresponding adjacency matrices), perfect matchings in nonbipartite graphs (or hafnians), and general matchings ...