Inclusion complete tally languages and the Hartmanis-Berman conjecture
- 1 December 1977
- journal article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 11 (1) , 1-8
- https://doi.org/10.1007/bf01768464
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- P-Complete Approximation ProblemsJournal of the ACM, 1976
- Translational lemmas, polynomial time, and (log n)j-spaceTheoretical Computer Science, 1976
- A comparison of polynomial time reducibilitiesTheoretical Computer Science, 1975
- On the Structure of Polynomial Time ReducibilityJournal of the ACM, 1975
- Tally languages and complexity classesInformation and Control, 1974
- Comparing complexity classesJournal of Computer and System Sciences, 1974
- Turing machines and the spectra of first-order formulasThe Journal of Symbolic Logic, 1974
- A note on multihead automata and context-sensitive languagesActa Informatica, 1973
- 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