Two tapes versus one for off-line Turing machines

Authors:
Wolfgang Maass;George Schnitger;Endre Szemerédi;György Turán
Affiliations:
-;-;-;-
Venue:
Computational Complexity
Year:
1993

Citing 0
Cited 3

Two heads are better than two tapes

Journal of the ACM (JACM)
A time lower bound for satisfiability

Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
A logical characterisation of linear time on nondeterministic turing machines

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract