Pages that link to "Item:Q1082813"
From MaRDI portal
The following pages link to On the structure of one-tape nondeterministic Turing machine time hierarchy (Q1082813):
Displayed 7 items.
- Verifying time complexity of Turing machines (Q496007) (← links)
- Immunity and pseudorandomness of context-free languages (Q653340) (← 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)
- Verifying whether one-tape Turing machines run in linear time (Q2009635) (← links)
- Lower bounds and hardness magnification for sublinear-time shrinking cellular automata (Q2117099) (← links)
- THE ROLES OF ADVICE TO ONE-TAPE LINEAR-TIME TURING MACHINES AND FINITE AUTOMATA (Q3069734) (← links)