Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science
Reference13 articles.
1. J. Hartmanis andR. E. Stearns, On the computational complexity of algorithms,Trans. Amer. Math. Soc. 117 (1965) 285–306.
2. A. M. Turing, On computable numbers, with applications to the Entscheidungsproblem,Proc. London Math. Soc. (2)42 (1934) 230–265.
3. H. Hermes,Enumerability, Decidability, Computability, Springer-Verlag, Berlin-Göttingen-Heidelberg, 1965.
4. F. C. Hennie andR. E. Stearns, Two-tape simulation of multitape Turing machines,J. Assoc. Comput. Mach. 13 (1966), 533–546
5. S. S. Ruby andP. C. Fischer, Translational methods and computational complexity,Proc. IEEE Sixth Annual Conf. on Switching Theory and Automata, pp. 173–178, 1965.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献