3 citations · 3 across the 1 of their papers we have counts for
1 paper
Frank Ferraro, Garrett Hall, Andrew Wood
Aslam presents an algorithm he claims will count the number of perfect matchings in any incomplete bipartite graph with an algorithm in the function-computing version of NC, which…