10 citations · 10 across the 2 of their papers we have counts for
1 paper · 1 filter
Supratik Chakraborty, Aditya A. Shrotri, Moshe Y. Vardi
Counting the number of perfect matchings in bipartite graphs, or equivalently computing the permanent of 0-1 matrices, is an important combinatorial problem that has been extensive…