Login / Signup
The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines with Output Tape.
Martin Dietzfelbinger
Wolfgang Maass
Published in:
Theor. Comput. Sci. (1993)
Keyphrases
</>
turing machine
high speed
magnetic tape
read write
neural network
information retrieval
case study
high dimensional
linear algebra
real time
databases
data structure
upper bound
linear combination
memory requirements