On the structure of complexity classes
- 1 January 1974
- book chapter
- Published by Springer Nature
- p. 437-445
- https://doi.org/10.1007/3-540-06841-4_80
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Tally languages and complexity classesInformation and Control, 1974
- Comparing complexity classesJournal of Computer and System Sciences, 1974
- The Hardest Context-Free LanguageSIAM Journal on Computing, 1973
- A hierarchy for nondeterministic time complexityJournal of Computer and System Sciences, 1973
- A note on multihead automata and context-sensitive languagesActa Informatica, 1973
- On Languages Accepted in Polynomial TimeSIAM Journal on Computing, 1972
- A Note Concerning Nondeterministic Tape ComplexitiesJournal of the ACM, 1972
- 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
- Translational methods and computational complexityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1965