Alternation

Journal of the ACM (JACM)

Volumn 28, Issue 1, 1981, Pages 114-133

  Chandra, Ashok K ^a   Kozen, Dexter C ^a   Stockmeyer, Larry J ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976760215     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/322234.322243     Document Type: Article

References (27)

1. Aho, A.V., Hopcroft, J.E., and Ullman, J.D. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.
2. Berman, L. Precise bounds for Presburger arithmetic and the reals with addition. Proc. 18th IEEE Symp. on Foundations of Computer Science, Providence, R.I., 1977, pp. 95-99.
3. Borodin, A. Personal communication.
4. Chandra, A.K., and Stockmeyer, L.J. Alternation. Proc. 17th IEEE Symp. on Foundations of Computer Science, Houston, Texas, 1976, pp. 98-108.
5. Cook, S.A. The complexity of theorem proving procedures. Proc. 3rd ACM Symp. on Theory of Computing, Shaker Heights, Ohio, 1971, pp. 151-158.
6. Fischer, M.J., and Ladner, R.E. Propositional dynamic logic of regular programs. J. Comput Syst Sci. 18, 2 (1979), 194-211.
7. Goldschlager, L.M. A unified approach to models of synchronous parallel machines. Proc. 10th ACM Symp. on Theory of Computing, San Diego, Calif. 1978, pp. 89-94.
8. Hartmanis, J., and Hunt, H.B. III. The LBA problem and its importance in the theory of computing. In Complexity of Computation, R.M. Karp, Ed., American Mathematical Society, Providence, R.I., 1974, pp. 1-26.
9. Hartmanis, J., and Simon, J. On the power of multiplication in random access machines. Proc. 15th IEEE Symp. on Switching and Automata Theory, New Orleans, La., 1974, pp. 13-23.
10. Hopcroft, J.E., and Ullman, J.D. Formal Languages and their Relation to Automata. Addison-Wesley, Reading, Mass., 1969.
11. Karp, R.M. Reducibility among combinatorial problems. In Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, Eds., Plenum Press, New York, 1972, pp. 85-104.
12. Kasai, T., Adachi, A., and Iwata, S. Classes of pebble games and complete problems. SIAM J Comput. 8 (1979), 574-586.
13. Kozen, D. On parallelism in Turing machines. Proc. 17th IEEE Symp. on Foundations of Computer Science, Houston, Texas, 1976, pp. 89-97.
14. Kozen, D. Complexity of Boolean algebras. Theoret. Comput. Sci. 70 (1980), 221-247.
15. Ladner, R.E., Lipton, R.J., and Stockmeyer, L.J. Alternating pushdown automata. Proc. 19th IEEE Symp. on Foundations of Computer Science, Ann Arbor, Mich., 1978.
16. Meyer, A.R., and Fischer, M.J. Economy of description of automata, grammars, and formal systems. Proc. 12th IEEE Symp. on Switching and Automata Theory, East Lansing, Mich 1971 pp 188-191.
17. Pratt, V.R., and Stockmeyer, L.J. A characterization of the power of vector machines. J. Comput Syst. Sci. 12 (1976), 198-221.
18. Rabin, M.O., and Scott, D. Finite automata and their decision problems. IBM J. Res Dev 3 (1959), 115-125.
19. Ruzzo, W.L. General context-free language recognition. Ph.D. Diss., Computer Science Division, Univ. of California, Berkeley, Calif., 1978.
20. Savitch, W.J. Relationships between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci 4 (1970), 177-192.
21. Savitch, W.J., and Stimson, M.J. The complexity of time bounded recursive computations. Proc. 1976 Johns Hopkins Conf. on Information Sciences and Systems, Baltimore, Md., pp. 42-46.
22. Scott, D. Outline of a mathematical theory of computation. Proc. 4th Ann. Princeton Conf. on Information Sciences and Systems, Princeton, N. J. 1970, pp. 169-176.
23. Simon, J. On feasible numbers. Proc. 9th ACM Symp. on Theory of Computing, Boulder, Colo 1977, pp. 195-207.
24. Stockmeyer, L.J. The polynomial-time hierarchy. Theoret. Comput. Sci. 3 (1977), 1-22.
25. Stockmeyer, L.J., and Chandra, A.K. Provably difficult combinatorial games. SIAM J Comput 8 (1979), 151-174.
26. Stockmeyer, L.J., and Meyer, A.R. Word problems requiring exponential time: Preliminary report. Proc. 5th ACM Symp. on Theory of Computing, Austin, Texas, 1973, pp. 1-9.
27. Wrathall, C. Complete sets and the polynomial-time hierarchy. Theoret. Comput. Sci 3 (1977) 23-34.