Skip to content

The Matching Problem for Bipartite Graphs with Polynomially Bounded Permanents Is in NC (Extended Abstract)

Dima Grigoriev, Marek Karpinski

VenueA*FOCS
Year1987
ProceedingsFOCS

Browse the full FOCS paper archive.