Verifying time complexity of Turing machines
From MaRDI portal
Publication:496007
DOI10.1016/j.tcs.2015.07.028zbMath1329.68111arXiv1307.3648OpenAlexW850465257MaRDI QIDQ496007
Publication date: 16 September 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.3648
Related Items
Cites Work
- Theory of one-tape linear-time Turing machines
- On the structure of one-tape nondeterministic Turing machine time hierarchy
- Arithmetical hierarchy and complexity of computation
- Computational Complexity
- Computational Complexity of One-Tape Turing Machine Computations
- One-tape, off-line Turing machine computations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item