Pages that link to "Item:Q2552124"
From MaRDI portal
The following pages link to Tape bounds for time-bounded Turing machines (Q2552124):
Displaying 18 items.
- Complexity lower bounds for machine computing models (Q1057651) (← links)
- Speedups of deterministic machines by synchronous parallel machines (Q1074339) (← links)
- On the structure of one-tape nondeterministic Turing machine time hierarchy (Q1082813) (← links)
- Relating the power of cellular arrays to their closure properties (Q1104098) (← links)
- Parallel computation with threshold functions (Q1107324) (← links)
- On alternation (Q1141480) (← links)
- A space bound for one-tape multidimensional Turing machines (Q1152219) (← links)
- On time versus space. II (Q1152954) (← links)
- Complexity of algorithms and computations (Q1153141) (← links)
- Time complexity of multidimensional Turing machines (Q1168311) (← links)
- Log space machines with multiple oracle tapes (Q1242686) (← links)
- On minimal-node-cost planar embeddings (Q3338119) (← links)
- On time versus space III (Q3745280) (← links)
- Space-bounded simulation of multitape turing machines (Q3928247) (← links)
- (Q4088301) (← links)
- Space bounds for a game on graphs (Q4143082) (← links)
- Complexity and Polynomially Solvable Special Cases of QUBO (Q5050143) (← links)
- Complexity of Nondeterministic Multitape Computations Based on Crossing Sequences (Q5200101) (← links)