Pages that link to "Item:Q3974874"
From MaRDI portal
The following pages link to Some time-space bounds for one-tape deterministic Turing machines (Q3974874):
Displaying 14 items.
- Verifying time complexity of Turing machines (Q496007) (← links)
- Theory of one-tape linear-time Turing machines (Q1041220) (← links)
- Deterministic simulation of a single tape turing machine by a random access machine in sub-linear time (Q1193594) (← links)
- Two tapes versus one for off-line Turing machines (Q1321033) (← links)
- A note on the density of oracle decreasing time-space complexity (Q1334680) (← links)
- A note on square rooting of time functions of Turing machines (Q1405791) (← links)
- The speed of copying on one-tape off-line turing machines (Q1824387) (← links)
- Linear-time simulation of multihead Turing machines (Q1825664) (← links)
- Element distinctness on one-tape Turing machines: a complete solution (Q1889761) (← links)
- (Q3751009) (← links)
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science (Q5191506) (← links)
- (Q5192993) (← links)
- Element Distinctness and Sorting on One-Tape Off-Line Turing Machines (Q5448667) (← links)
- SOFSEM 2004: Theory and Practice of Computer Science (Q5902006) (← links)