Relativization of questions about log space computability
- 1 December 1976
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 10 (1) , 19-32
- https://doi.org/10.1007/bf01683260
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Space-bounded reducibility among combinatorial problemsJournal of Computer and System Sciences, 1975
- On tape-bounded complexity classes and multihead finite automataJournal of Computer and System Sciences, 1975
- On the Structure of Polynomial Time ReducibilityJournal of the ACM, 1975
- The circuit value problem is log space complete for PACM SIGACT News, 1975
- An observation on time-storage trade offPublished by Association for Computing Machinery (ACM) ,1973
- On non-determinancy in simple computing devicesActa Informatica, 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
- Nonerasing stack automataJournal of Computer and System Sciences, 1967