Relations Between Time and Tape Complexities
Journal of the ACM (JACM)
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
Complexity of nondeterministic multitape computations based on crossing sequences
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Simulations Between Multi-dimensional Deterministic and Alternating Cellular Automata
Fundamenta Informaticae - Cellular Automata
A padding technique on cellular automata to transfer inclusions of complexity classes
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
| Hi-index | 0.00 |
Let L be a language recognized by a nondeterministic (single-tape) Turing machine of time complexity T(n)=n^2. Then L is also recognized by a deterministic (single-tape) Turing machine of tape complexity T^1^/^2(n).