Pages that link to "Item:Q2009635"
From MaRDI portal
The following pages link to Verifying whether one-tape Turing machines run in linear time (Q2009635):
Displaying 6 items.
- Verifying time complexity of Turing machines (Q496007) (← links)
- Theory of one-tape linear-time Turing machines (Q1041220) (← links)
- An NP-complete language accepted in linear time by a one-tape Turing machine (Q1183577) (← links)
- (Q5192993) (← links)
- Two Tests for the Linearity of Sequential Machines (Q5518382) (← links)
- SOFSEM 2004: Theory and Practice of Computer Science (Q5902006) (← links)