Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
FOCS
/
Paper
The Matching Problem for Bipartite Graphs with Polynomially Bounded Permanents Is in NC (Extended Abstract)
Dima Grigoriev
,
Marek Karpinski
Venue
A*
FOCS
Year
1987
Proceedings
FOCS
DBLP record
conf/focs/GrigorievK87 ↗
Browse the full
FOCS paper archive
.