On efficient deterministic simulation of turing machine computations below logaspace
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 17549
- Fast Simulations of Time-Bounded One-Tape Turing Machines by Space-Bounded Ones
- Tally Versions of the Savitch and Immerman–Szelepcsényi Theorems for Sublogarithmic Space
- Improved simulation of nondeterministic Turing machines
- Deterministic simulation of non-deterministic Turing machines (detailed abstract)
Cites work
Cited in
(10)- An improved simulation of space and reversal bounded deterministic Turing machines by width and depth bounded uniform circuits
- A survey of space complexity
- scientific article; zbMATH DE number 3883610 (Why is no real title available?)
- On efficient simulations of multicounter machines
- On space and time efficient TM simulations of some restricted classes of PDA's
- scientific article; zbMATH DE number 3986645 (Why is no real title available?)
- Sublogarithmic-space turing machines, nonuniform space complexity, and closure properties
- Tally Versions of the Savitch and Immerman–Szelepcsényi Theorems for Sublogarithmic Space
- Trading determinism for time in space bounded computations
- Deterministic simulation of non-deterministic Turing machines (detailed abstract)
This page was built for publication: On efficient deterministic simulation of turing machine computations below logaspace
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3742717)