Space-bounded simulation of multitape turing machines

DOI10.1007/BF01752397MaRDI QIDQ3928247zbMATH OpenFDO

Authors Leonard M. Adleman, Michael C. Loui

Publication date 1981

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

Full work available at URL https://doi.org/10.1007/BF01752397

zbMATH Keywords

overlapspace complexitytime complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites work

• scientific article; zbMATH DE number 3692650 (Why is no real title available?)
• scientific article; zbMATH DE number 3471609 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• On Time Versus Space
• Relations Between Time and Tape Complexities
• Tape bounds for time-bounded Turing machines

Cited in

(4)

• Relativized alternation and space-bounded computation
• The size and depth of layered Boolean circuits
• On time versus space III
• Simulating time with square-root space

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3928247)