Parameterizing the Permanent: Hardness for $K_8$-minor-free graphs

Radu Curticapean, Mingji Xia

In the 1960s, statistical physicists discovered a fascinating algorithm for counting perfect matchings in planar graphs. Valiant later showed that the same problem is #P-hard for g…