Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STACS
/
Paper
The Polynomially Bounded Perfect Matching Problem Is in NC
Manindra Agrawal
,
Thanh Minh Hoang
,
Thomas Thierauf
Venue
A
STACS
Year
2007
Proceedings
STACS
DBLP record
conf/stacs/AgrawalHT07 ↗
Browse the full
STACS paper archive
.