The number of perfect matchings in planar graphs can be computed in polynomial (in the number of vertices) time.