Translational lemmas, polynomial time, and (log n)j-space
- 29 February 1976
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 1 (3) , 215-226
- https://doi.org/10.1016/0304-3975(76)90057-8
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Comparing complexity classesJournal of Computer and System Sciences, 1974
- The Hardest Context-Free LanguageSIAM Journal on Computing, 1973
- On Languages Accepted in Polynomial TimeSIAM Journal on Computing, 1972
- A Note Concerning Nondeterministic Tape ComplexitiesJournal of the ACM, 1972
- A hierarchy for nondeterministic time complexityPublished by Association for Computing Machinery (ACM) ,1972
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971
- Characterizations of Pushdown Machines in Terms of Time-Bounded ComputersJournal of the ACM, 1971
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970
- On the computational complexity of algorithmsTransactions of the American Mathematical Society, 1965
- Translational methods and computational complexityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1965