Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STACS
/
Paper
Complete Problems and Strong Polynomial Reducibilities.
K. Ganesan
,
Steven Homer
Venue
A
STACS
Year
1989
Proceedings
STACS
DBLP record
conf/stacs/GanesanH89 ↗
Browse the full
STACS paper archive
.