Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STOC
/
Paper
Storage Requirements for Deterministic Polynomial Time Recognizable Languages
Stephen A. Cook
,
Ravi Sethi
Venue
A*
STOC
Year
1974
Proceedings
STOC
DBLP record
conf/stoc/CookS74 ↗
Browse the full
STOC paper archive
.