Paterson, Michael S. Tape bounds for time-bounded Turing machines. (English) Zbl 0236.02031 J. Comput. Syst. Sci. 6, 116-124 (1972). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 19 Documents MSC: 03D10 Turing machines and related notions 68Q25 Analysis of algorithms and problem complexity × Cite Format Result Cite Review PDF Full Text: DOI References: [1] Savitch, W. J., Relationships between nondeterministic and deterinistic tape complexities, J. Comput. System Sci., 4, 177-192 (1970) · Zbl 0188.33502 [2] Hopcroft, J. E.; Ullman, J. D., Relations between time and tape complexities, J. Assoc. Comput. Mach., 15, 414-427 (1968) · Zbl 0169.31103 [3] Paterson, M. S., Tape Bounds for Time-bounded Turing Machines, (Conference Record of 11th IEEE Symposium on Switching and Automata Theory (1970)) · Zbl 0289.02020 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.