Storage Requirements for Deterministic Polynomial Time Recognizable Languages

Stephen Cook, Ravi Sethi. Storage Requirements for Deterministic Polynomial Time Recognizable Languages. In Conference Record of Sixth Annual ACM Symposium on Theory of Computing, 30 April-2 May 1974, Seattle, Washington, USA. pages 33-39, ACM, 1974.

@inproceedings{CookS74,
  title = {Storage Requirements for Deterministic Polynomial Time Recognizable Languages},
  author = {Stephen Cook and Ravi Sethi},
  year = {1974},
  researchr = {https://researchr.org/publication/CookS74},
  cites = {0},
  citedby = {0},
  pages = {33-39},
  booktitle = {Conference Record of Sixth Annual ACM Symposium on Theory of Computing, 30 April-2 May 1974, Seattle, Washington, USA},
  publisher = {ACM},
}