The matching problem for bipartite graphs with polynomially bounded permanents is (1987)

by GRIGORIEV, M KARPINSKI
Venue:in NC, Proc. 28th IEEE Syrup. Foundations of Comp. Sci