On Languages Accepted in Polynomial Time
- 1 December 1972
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 1 (4), 281-287
- https://doi.org/10.1137/0201019
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- A Note Concerning Nondeterministic Tape ComplexitiesJournal of the ACM, 1972
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,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
- Relationships between nondeterministic and deterministic tape complexitiesJournal 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