Storage requirements for deterministic polynomial time recognizable languages

Stephen Cook; Ravi Sethi

doi:10.1145/800119.803882

Storage requirements for deterministic polynomial time recognizable languages

Stephen Cook, Ravi Sethi

Computer Science

Research output: Contribution to journal › Conference article › peer-review

10 Scopus citations

Original language	English (US)
Pages (from-to)	33-39
Number of pages	7
Journal	Proceedings of the Annual ACM Symposium on Theory of Computing
DOIs	https://doi.org/10.1145/800119.803882
State	Published - Jan 1 1974
Event	6th Annual ACM Symposium on Theory of Computing, STOC 1974 - Seattle, United States Duration: Apr 30 1974 → May 2 1974

ASJC Scopus subject areas

Software

Access to Document

10.1145/800119.803882

Cite this

@article{90f07e8c493548d5978018676438945e,

title = "Storage requirements for deterministic polynomial time recognizable languages",

author = "Stephen Cook and Ravi Sethi",

year = "1974",

month = jan,

day = "1",

doi = "10.1145/800119.803882",

language = "English (US)",

pages = "33--39",

journal = "Proceedings of the Annual ACM Symposium on Theory of Computing",

issn = "0737-8017",

publisher = "Association for Computing Machinery (ACM)",

note = "6th Annual ACM Symposium on Theory of Computing, STOC 1974 ; Conference date: 30-04-1974 Through 02-05-1974",

}

TY - JOUR

T1 - Storage requirements for deterministic polynomial time recognizable languages

AU - Cook, Stephen

AU - Sethi, Ravi

PY - 1974/1/1

Y1 - 1974/1/1

UR - https://www.scopus.com/pages/publications/85025139067

UR - https://www.scopus.com/inward/citedby.url?scp=85025139067&partnerID=8YFLogxK

U2 - 10.1145/800119.803882

DO - 10.1145/800119.803882

M3 - Conference article

AN - SCOPUS:85025139067

SN - 0737-8017

SP - 33

EP - 39

JO - Proceedings of the Annual ACM Symposium on Theory of Computing

JF - Proceedings of the Annual ACM Symposium on Theory of Computing

T2 - 6th Annual ACM Symposium on Theory of Computing, STOC 1974

Y2 - 30 April 1974 through 2 May 1974

ER -

Storage requirements for deterministic polynomial time recognizable languages

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this