Deterministic CFL s Are Accepted Simultaneously in Polynomial Time and Log Squared Space

Stephen A. Cook. Deterministic CFL s Are Accepted Simultaneously in Polynomial Time and Log Squared Space. In Conference Record of the Eleventh Annual ACM Symposium on Theory of Computing, 30 April-2 May, 1979, Atlanta, Georgia, USA. pages 338-345, ACM, 1979.

@inproceedings{Cook79,
  title = {Deterministic CFL s Are Accepted Simultaneously in Polynomial Time and Log Squared Space},
  author = {Stephen A. Cook},
  year = {1979},
  researchr = {https://researchr.org/publication/Cook79},
  cites = {0},
  citedby = {0},
  pages = {338-345},
  booktitle = {Conference Record of the Eleventh Annual ACM Symposium on Theory of Computing, 30 April-2 May, 1979, Atlanta, Georgia, USA},
  publisher = {ACM},
}