Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STOC
/
Paper
Fast Algorithms for N-Dimensional Restrictions of Hard Problems
Friedhelm Meyer auf der Heide
Venue
A*
STOC
Year
1985
Proceedings
STOC
DBLP record
conf/stoc/Heide85 ↗
Browse the full
STOC paper archive
.