scientific article; zbMATH DE number 3856412

MaRDI QIDQ3325045zbMATH OpenFDO

Authors Armin Hemmerling

Publication date 1983

zbMATH Keywords

determinism versus nondeterminismmulti- dimensional Turing machinesspace complexitysublogarithmic space

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• ZUR RAUMKOMPLIZIERTHEIT MEHRDIMENSIONALER TURING‐AUTOMATEN
• A note on one-pebble two-dimensional Turing machines
• A note on one-pebble two-dimensional Turing machines
• scientific article; zbMATH DE number 3984575
• Nondeterministic Computations in Sublogarithmic Space and Space Constructibility

Cited in

(1)

• ZUR RAUMKOMPLIZIERTHEIT MEHRDIMENSIONALER TURING‐AUTOMATEN

This page was built for publication:

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