A space bound for one-tape multidimensional Turing machines

DOI10.1016/0304-3975(81)90084-0zbMath0459.68018OpenAlexW1984849808MaRDI QIDQ1152219

Michael C. Loui

Publication date: 1981

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(81)90084-0

zbMATH Keywords

time complexityspace complexitycrossing sequences

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (1)

On time versus space III

Cites Work

• Tape bounds for time-bounded Turing machines
• On Time Versus Space
• Space-time trade-offs on the FFT algorithm
• A Time-Space Trade-Off
• Time-space tradeoffs for computing functions, using connectivity properties of their circuits
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A space bound for one-tape multidimensional Turing machines