Space-bounded simulation of multitape turing machines

DOI10.1007/BF01752397zbMath0473.68045MaRDI QIDQ3928247

Leonard M. Adleman, Michael C. Loui

Publication date: 1981

Published in: Mathematical Systems Theory (Search for Journal in Brave)

zbMATH Keywords

overlaptime complexityspace complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (3)

Relativized alternation and space-bounded computation ⋮ On time versus space III ⋮ The size and depth of layered Boolean circuits

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tape bounds for time-bounded Turing machines
• On Time Versus Space
• Relations Between Time and Tape Complexities

This page was built for publication: Space-bounded simulation of multitape turing machines