Separating Nondeterministic Time Complexity Classes

Journal of the ACM (JACM)

Volumn 25, Issue 1, 1978, Pages 146-167

  Seiferas, Joel I ^a   Fischer, Michael J ^b   Meyer, Albert R ^c  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF WASHINGTON   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

complexity class; complexity hierarchy; dmgonahzatmn; nondetermmism; padding; recursmn theorem; single1 letter alphabet; time complexity; Turlng machine

Indexed keywords

EID: 84976764290     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/322047.322061     Document Type: Article

References (32)

1. Aanderaa, S.O. On k-tape versus (k — 1)-tape real time computation. In Complexity of Computation (SIAM-AMS Proceedings, Vol 7), R M Karp, Ed, Amer Math. Soc, Providence, R I, 1974, pp 75-96.
2. Blum, M. A machine-independent theory of the complexity of recursive functions J. ACM 14, 2 (April 1967), 322-336.
3. Book, R V, and Greibach, S.A. Quasi-realtime languages Math. Syst Theory 4, 2 (June 1970), 97-111.
4. Book, R V., Greibach, S A, and Wegbreit, B. Time- and tape-bounded Turing acceptors and AFLs. J. Comptr Syst Sci 4, 6 (Dec 1970), 606-621.
5. Constable, R.L. The operator gap J. ACM 19, 1 (Jan. 1972), 175-183.
6. Constable, R.L. Two types of hierarchy theorem for axiomatic complexity classes In Computational Complexity, R Rustin, Ed., Algonthmics Press, New York, 1973, pp 37-63.
7. Cook, S A. A hierarchy for nondetermimstic time complexity. J Comptr Syst Sci. 7, 4 (Aug. 1973), 343-353.
8. Fischer, M. J. and Rabin, M.O. Super-exponential complexity of Presburger arithmetic In Complexity of Computation (SIAM-AMS Proceedings, Vol. 7), R M Karp, Ed., Amer Math Soc, Providence, R I., 1974, pp 27-41.
9. Fischer, P. C., Meyer, A.R. and Rosenberg, A. L. Real-time simulation of multihead tape units. J ACM 19, 4 (Oct 1972), 590-607.
10. Gill, J., and Blum, M On almost everywhere complex recursive functions. J ACM 21, 3 (July 1974), 425-435.
11. Hartmanis, J., and Stearns, R.E. On the computational complexity of algorithms. Trans Amer. Math. Soc 117 (May 1965), 285-306.
12. Hennie, F.C. and Stearns, R.E. Two-tape simulation of multitape Turing machines. J ACM 13, 4 (Oct. 1966), 533-546.
13. Hopcroft, J E., and Ullman, J D. Formal Languages and Their Relation to Automata Addison-Wesley, Reading, Mass, 1969.
14. Hunt, H.B. III The equivalence problem for regular expressions with intersection is not polynomial in tape. Tech Rep. 73-161, Dept, of Comptr Sci., Cornell U, Ithaca, N.Y, March 1973.
15. Ibarra, O H A note concerning nondetermimstic tape complexities. J. ACM 19, 4 (Oct 1972), 608-612.
16. Ibarra, O.H. On two-way multihead automata. J Comptr. Syst. Set 7, 1 (Feb 1973), 28-36.
17. Ibarra, O H A hierarchy theorem for polynomial-space recognition SIAM J. Comptng 3, 3 (Sept. 1974), 184-187.
18. Lynch, N.A., Meyer, A.R., and Fischer, M J Relativization of the theory of computational complexity. Trans. Amer Math. Soc 220 (June 1976), 243-287.
19. Meyer, A.R. Weak monadic second order theory of successor is not elementary-recursive In Logic Colloquium, Lecture Notes in Mathematics, No 453, R Parikh, Ed., Springer-Verlag, Berlin, 1975, pp 132-154.
20. Meyer, A.R. and Mccreight, E.M. Computationally complex and pseudo-random zero-one valued functions. In Theory of Machines and Computations, Z. Kohavi and A. Paz, Ed, Academic Press, New York, 1971, pp 19-42.
21. Meyer, A R., and Stockmeyer, L J The equivalence problem for regular expressions with squaring requires exponential space Proc 13th Annual Symp on Switching and Automata Theory, College Park, Md, 1972, pp 125-129.
22. Paul, W J On time hierarchies Proc Ninth Annual ACM Symp on Theory of Comptng., Boulder, Colo, 1977, pp. 218-222.
23. Rogers, H Jr Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York, 1967.
24. Ruby, S, and Fischer, P C Translational methods and computational complexity Conf. Rec. IEEE Symp. on Switching Circuit Theory and Logical Design. Ann Arbor, Mich, 1965, pp. 173-178.
25. Seiferas, J I Nondetermimstic time and space complexity classes. Tech. Rep. 137, Proj. MAC, M.I T., Cambridge, Mass, Sept 1974.
26. Seiferas, J.I. Techniques for separating space complexity classes J Comptr. Syst. Sci. 14, 1 (Feb. 1977), 73-99.
27. Seiferas, J I. Relating refined space complexity classes.J Comptr Syst. Sci. 14, 1 (Feb. 1977), 100-129.
28. Stockmeyer, L.J. The complexity of decision problems in automata theory and logic. Tech. Rep. 133, Proj MAC, M I T., Cambridge, Mass., June 1974.
29. Stockmeyer, L J. and Meyer, A R Word problems requiring exponential time: Preliminary report. Proc Fifth Annual ACM Symp. on Theory of Comptng., Austin, Tex., 1973, pp. 1-9.
30. Yamada, H. Real-time computation and recursive functions not real-time computable. IRE Trans. Electron. Comptrs. EC-11, 6 (Dec 1962), 753-760.
31. Yamada, H. Real-time computation and recursive functions not real-time computable. Corrections IEEE Trans. Electron. Comptrs. EC-12, 4 (Aug 1963), 400.
32. Young, P Easy constructions in complexity theory Gap and speed-up theorems. Proc. Amer. Math. Soc 37, 2 (Feb. 1973), 555-563.