Complexity of counting matchings in a bipartite graph
The problem of counting such "imperfect" matchings in bipartite graphs is #P-complete.
This has been proved by Les Valiant himself, on page 415 of the paper


  Leslie G. Valiant
  The Complexity of Enumeration and Reliability Problems
  SIAM J. Comput., 8(3), 410–421