Pages that link to "Item:Q5556431"
From MaRDI portal
The following pages link to Relations Between Time and Tape Complexities (Q5556431):
Displaying 14 items.
- On the structure of one-tape nondeterministic Turing machine time hierarchy (Q1082813) (← links)
- Comparison of the power between reversal-bounded ATMs and reversal- bounded NTMs (Q1094877) (← links)
- Relativized alternation and space-bounded computation (Q1111024) (← links)
- On time versus space. II (Q1152954) (← links)
- Complexity of algorithms and computations (Q1153141) (← links)
- Relationships between nondeterministic and deterministic tape complexities (Q2537313) (← links)
- Tape bounds for time-bounded Turing machines (Q2552124) (← links)
- Writing stack acceptors (Q2554233) (← links)
- A time lower bound for satisfiability (Q2581273) (← links)
- On time versus space III (Q3745280) (← links)
- Space-bounded simulation of multitape turing machines (Q3928247) (← links)
- The theory of languages (Q5551468) (← links)
- The theory of languages (Q5592247) (← links)
- On restricted turing computability (Q5632561) (← links)