ZUR RAUMKOMPLIZIERTHEIT MEHRDIMENSIONALER TURING‐AUTOMATEN

DOI10.1002/MALQ.19840301307zbMath0582.68017OpenAlexW2069517119MaRDI QIDQ3704892

Armin Hemmerling, Gerd Murawski

Publication date: 1984

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19840301307

zbMATH Keywords

complexity classesspace complexitydeterminism vs. nondeterminismTuring machines with d-dimensional input tape

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10)

This page was built for publication: ZUR RAUMKOMPLIZIERTHEIT MEHRDIMENSIONALER TURING‐AUTOMATEN