J. Hartmanis
J. E. Hopcroft
- AXT, P. Enumeration and the Grzegorczyk hierarchy. Z. Math. Logik Grundlagen Math. 9 (1963), 53-65.Google Scholar
- BECVAR, J. Real-time and complexity problems in automata theory. Kybernetika 1 (1965), 475--497.Google Scholar
- BLUM, N. On effective procedures for speeding up algorithms. Conf. Rec. ACM Symp. on Theory of Computing, 1969, pp. 43-53. Google Scholar
- BORODIN, A., CONSTABLE, R. L., AND HOPCROFT, J .E . Dense and nondense families of complexity classes. IEEE Conf. Rec. Tenth Ann. Symp. on Switching and Automata Theory, 1969, pp. 7-19.Google Scholar
- COBHAM, A. On the Hartmanis-Stearns problem for a class of tag machines. IEEE Conf. Rec. Ninth Ann. Symp. on Switching and Automata Theory, 1968, pp. 51-60.Google Scholar
- CONSTABLE, R.L. The operator gap. IEEE Conf. Rec. Tenth Ann. Symp. on Switching and Automata Theory, 1969, pp. 20-26.Google Scholar
- FISCHER, P. C. Multi-tape and infinite-state automata--a survey. Comm. ACM 8 (1965), 799--805. Google Scholar
- FISCHER, P. C. The reduction of tape reversals for off-line one-tape Turing machines," J. Computer Systems Sciences 2 (1968), 136-147.Google Scholar
- FISCHER, P. C., HARTMANIS J. AND BLUM M. Tape reversal complexity hierarchies. IEEE Conf. Rec. Ninth Ann. Syrup. on Switching and Automata Theory, 1968, pp. 373-382.Google Scholar
- GRZEGORCZYK, A. Some classes of recursive functions. Rozprawy Mat. $, Warsaw, (1953), 1-45.Google Scholar
- HARTMANIS, J. Tape reversal bounded Turing machine computations. J. Computer Systems Sciences 2 (1968), 117-135.Google Scholar
- HENNIE, F. C. One-tape, off-line Turing machine computations. Inf. Conlr. 8 (1965), 553- 578.Google Scholar
- HENNIE, F. C. Crossing sequences and off-line Turing machine computations. 1965 IEEE Conf. Rec. on Switching Circuit Theory and Logical Design, pp. 168-172.Google Scholar
- HOPCROFT, J. E., AND ULLMAN, J.D. Relations between time and tape complexities. J. ACM 15 (1958), 414-427. Google Scholar
- HOPCROFT, J. E., AND ULLMAN, J. D. Some results on tape bounded Turing machines," J. ACM 16 (1969), 168--177. Google Scholar
- IRLAND, M. I., AND FISCHER, P.C. A bibliography on computational complexity. Res. Rep. CSRR 2028, U. of Waterloo, Ontario, Canada, Oct. 1970.Google Scholar
- KARP, R.M. Some bounds on the storage requirements of sequential machines and Turing machines. J. ACM 1~ (1967), 478--489. Google Scholar
- LEwis, P. M. II, STEARNS, R. E., AND HARTMANIS, J. Memory bounds for recognition of context-free and context-sensitive languages. 1965 IEEE Conf. Rec. on Switching Circuit Theory and Logical Design, pp. 191-202.Google Scholar
- MCCREIGHT, E. M. Classes of computable functions defined by bounds on computation. Doctoral Th., Computer Sci. Dep., Carnegie-Mellon U., Pittsburgh, Pa., 1969. Google Scholar
- MEYER, A. R., AND RITCHIE, D.M. The complexity of loop programs. Proc. ACM 22nd Nat. Conf., 1967, Psychonetics, Narberth, Pa., pp. 465-469. Google Scholar
- RABIN, M.O. Real time computation. Israel J. Math. I (1964), 203-211.Google Scholar
- RITCHIE, R.W. Classes of predictably computable functions. Trans. Amer. Math. Soc. 106 (1963), 139-173.Google Scholar
- SAVlTCH, W. J. Deterministic simulation of non-deterministic Turing machines (detailed abstract). Conf. Rec. ACM Symp. on Theory of Computing, 1969, pp. 247-248. Google Scholar
- TRAKHTENBROT, B.A. Turing computations with logorithmie delay. Algebra i Logika 3, ~, in Russian, (1964), 33-48.Google Scholar
- YAMADA, H. Real-time computation and recursive functions not real-time computable," IRE Trans. Elec. Comp. EC-11 (1962), 753-760.Google Scholar
Index Terms
- An Overview of the Theory of Computational Complexity
Recommendations
An overview of computational complexity
ACM Turing award lecturesAn historical overview of computational complexity is presented. Emphasis is on the fundamental issues of defining the intrinsic computational complexity of a problem and proving upper and lower bounds on the complexity of problems. Probabilistic and ...
An overview of computational complexity
An historical overview of computational complexity is presented. Emphasis is on the fundamental issues of defining the intrinsic computational complexity of a problem and proving upper and lower bounds on the complexity of problems. Probabilistic and ...
Comments