Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus.

Radu Curticapean, Dniel Marx

Browse the full SODA paper archive.