Problem is #-P complete even for bipartite graphs with maximum degree four.

There are estimates for the number of perfect matchings in some families of graphs. For example, for planar graphs, or for regular graphs. General estimations usually have poor quality.