Comparing complexity classes
- 1 October 1974
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 9 (2) , 213-229
- https://doi.org/10.1016/s0022-0000(74)80008-5
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A hierarchy for nondeterministic time complexityJournal of Computer and System Sciences, 1973
- On Languages Accepted in Polynomial TimeSIAM Journal on Computing, 1972
- A Note Concerning Nondeterministic Tape ComplexitiesJournal of the ACM, 1972
- A note on AFLs and bounded erasingInformation and Control, 1971
- Characterizations of Pushdown Machines in Terms of Time-Bounded ComputersJournal of the ACM, 1971
- Tape-bounded turing acceptors and principal AFLsJournal of Computer and System Sciences, 1970
- Time- and tape-bounded turing acceptors and AFLsJournal of Computer and System Sciences, 1970
- Principal AFLJournal of Computer and System Sciences, 1970
- Quasi-realtime languagesTheory of Computing Systems, 1970
- On the computational complexity of algorithmsTransactions of the American Mathematical Society, 1965