Funder
Slovenian Research Agency
Subject
General Computer Science,Theoretical Computer Science
Reference10 articles.
1. Computational Complexity: A Modern Approach;Arora,2009
2. Computational complexity of one-tape Turing machine computations;Hartmanis;J. ACM,1968
3. Feasible Computations and Provable Complexity Properties;Hartmanis,1978
4. One-tape, off-line Turing machine computations;Hennie;Inf. Control,1965
5. Arithmetical hierarchy and complexity of computation;Hájek;Theoret. Comput. Sci.,1979
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献