Storage requirements for deterministic polynomial time recognizable languages

Stephen Cook, Ravi Sethi

Research output: Contribution to journalConference article

6 Citations (Scopus)
Original languageEnglish (US)
Pages (from-to)33-39
Number of pages7
JournalProceedings of the Annual ACM Symposium on Theory of Computing
DOIs
StatePublished - Jan 1 1974
Externally publishedYes
Event6th Annual ACM Symposium on Theory of Computing, STOC 1974 - Seattle, United States
Duration: Apr 30 1974May 2 1974

Fingerprint

Polynomials

ASJC Scopus subject areas

  • Software

Cite this

Storage requirements for deterministic polynomial time recognizable languages. / Cook, Stephen; Sethi, Ravi.

In: Proceedings of the Annual ACM Symposium on Theory of Computing, 01.01.1974, p. 33-39.

Research output: Contribution to journalConference article

@article{90f07e8c493548d5978018676438945e,
title = "Storage requirements for deterministic polynomial time recognizable languages",
author = "Stephen Cook and Ravi Sethi",
year = "1974",
month = "1",
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)",

}

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 - http://www.scopus.com/inward/record.url?scp=85025139067&partnerID=8YFLogxK

UR - http://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

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

SN - 0737-8017

ER -