Tape bounds for time-bounded turing machines
Author:
- Michael S. PatersonMPMichael S. Paterson
- 1 April 1972
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 6 (2) , 116-124
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970
- Relations Between Time and Tape ComplexitiesJournal of the ACM, 1968