A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
The complexity of matrix transposition on one-tape off-line Turing machines

1991
*
Theoretical Computer Science
*

Dietzfelbinger, M., W. Maass and G. Schnitger, The complexity of matrix transposition on one-tape off-line Turing machines, Theoretical Computer Science, 82 (1991) 113-129. This paper contains the first concrete lower bound argument for Turing machines with one worktape and a two-way input tape ("one-tape o&line Turing machines"): an optimal lower bound of a( n * I/ [(log(l)/p)"21) for transposing an 1 x l-matrix with elements of bit length p on such machines is proved. (The length of the input

doi:10.1016/0304-3975(91)90175-2
fatcat:fkt4rvugerhqzinuaqpukhzqde