24 citations · 33 across the 2 of their papers we have counts for
1 paper · 1 filter
Daniel Štefankovič, Eric Vigoda, John Wilmes
Counting perfect matchings has played a central role in the theory of counting problems. The permanent, corresponding to bipartite graphs, was shown to be #P-complete to compute ex…