scientific article; zbMATH DE number 17549
From MaRDI portal
Publication:3974874
Recommendations
- Fast Simulations of Time-Bounded One-Tape Turing Machines by Space-Bounded Ones
- Matching upper and lower bounds for simulations of several linear tapes on one multidimensional tape
- scientific article; zbMATH DE number 2077107
- scientific article; zbMATH DE number 4078813
- scientific article; zbMATH DE number 1222593
Cited in
(23)- Theory of one-tape linear-time Turing machines
- Deterministic simulation of a single tape turing machine by a random access machine in sub-linear time
- A note on the density of oracle decreasing time-space complexity
- A note on square rooting of time functions of Turing machines
- The speed of copying on one-tape off-line turing machines
- Linear-time simulation of multihead Turing machines
- Element distinctness on one-tape Turing machines: a complete solution
- Mutual upper bounds of size and time for a Turing machine and a Markov-Post algorithm for mutual simulations
- Fast Simulations of Time-Bounded One-Tape Turing Machines by Space-Bounded Ones
- On efficient deterministic simulation of turing machine computations below logaspace
- scientific article; zbMATH DE number 3988711 (Why is no real title available?)
- Speed-Up of Turing Machines with One Work Tape and a Two-Way Input Tape
- A method of analyzing turing computations. II
- scientific article; zbMATH DE number 4049057 (Why is no real title available?)
- scientific article; zbMATH DE number 4078813 (Why is no real title available?)
- scientific article; zbMATH DE number 1222593 (Why is no real title available?)
- scientific article; zbMATH DE number 2077107 (Why is no real title available?)
- scientific article; zbMATH DE number 3995054 (Why is no real title available?)
- Verifying time complexity of Turing machines
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- scientific article; zbMATH DE number 5593330 (Why is no real title available?)
- Element Distinctness and Sorting on One-Tape Off-Line Turing Machines
- SOFSEM 2004: Theory and Practice of Computer Science
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 Q3974874)