We analyze the behavior of the Barvinok estimator of the hafnian of even dimension, symmetric matrices with nonnegative entries. We introduce a condition under which the Barvinok estimator achieves subexponential errors, and show that this condition is almost optimal. Using that hafnians count the number of perfect matchings in graphs, we conclude that Barvinok’s estimator gives a polynomial-time algorithm for the approximate (up to subexponential errors) evaluation of the number of perfect matchings.
"Hafnians, perfect matchings and Gaussian matrices." Ann. Probab. 44 (4) 2858 - 2888, July 2016. https://doi.org/10.1214/15-AOP1036