Counting perfect matchings in bipartite graphs is $\# P$ complete. Let $G(V,E)$ be a graph known to have $d$ number of perfect matchings. Bipartite it the obvious way by adding $E$ vertices with one vertex splitting each edge.

Is counting the number of perfect matchings in the new graph $\# P$ complete?