Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science
Reference12 articles.
1. C. C. Elgot andA. Robinson, Random-access stored-program machines, an approach to programming languages,J. Assoc. Comput. Mach. 11 (1964), 365–399.
2. S. A. Cook, Computational complexity using random access machines, Course Notes, University of California, Berkeley, 1970.
3. J. Hartmanis andR. E. Stearns, On the computational complexity of algorithms,Trans. Amer. Math. Soc. 117 (1965), 285–306.
4. J. Hartmanis, Computational complexity of one-tape Turing machine computations,J. Assoc. Comput. Mach. 15 (1968), 325–339.
5. J. Hartmanis, Tape reversal bounded Turing machine computations,J. Comput. System Sci. 2 (1968), 117–135.
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献