Alternation

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 1976-October, Issue , 1976, Pages 98-108

  Chandra, Ashok K ^a   Stockmeyer, Larry J ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

MACHINERY; POLYNOMIAL APPROXIMATION;

ALTERNATING POLYNOMIALS; ALTERNATING TURING MACHINES; DETERMINISTIC AUTOMATA; PARALLEL PROCESSING; PARALLEL PROCESSING MODELS; POLYNOMIAL SPACE; PUSH-DOWN AUTOMATA; UNIVERSAL QUANTIFIERS;

TURING MACHINES;

EID: 84990595191     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.1976.4567893     Document Type: Conference Paper

References (31)

1. Kleene, S. C, Introduction to Meta-mathematics, Van Nostrand, 1952.
2. Manna, Z. and Vuillemin, J., Fixpoint approach to the theory of computation, Stanford University Report STAN-CS-72, 272, AIM-164, March 1972.
3. Scott, D., Outline of a mathematical theory of computation, Oxford University Monograph PRG-2, November 1970.
4. Book, R. V., Translational lemmas, polynomial time, and (logn) J-space, Theoretical Computer Science 1(1976), 215-226.
5. Savitch, W. J., Relationships between nondeterministic and deterministic tape complexities, J. Comput. Syst. Sci. 4(1970), 177-192.
6. th Annual ACM Symposium on Theory of Computing, May 1975, Albuquerque, 66-71.
7. th Annual ACM Symposium on Theory of Computing, May 1976, Hershey, 41-49.
8. Cobham, A., The intrinsic computational difficulty of functions, Proceedings of the 1964 International Congress for Logic, Methodology, and Philosophy of Science, North Holland, Amsterdam, 24-30.
9. rd Annual ACM Symposium on Theory of Computing, May 1971, Shaker Heights, 151-158.
10. Pratt, V. R. and Stockmeyer, L. J., A characterization of the power of vector machines, J. Comput. Syst. Sci. 12(1976), 198-221.
11. th Annual Symposium on Switching and Automata Theory, October 1974, New Orleans, 13-23.
12. Simon, J., On some central problems in computational complexity, Tech. Report TR75-224, CS Dept., Cornell University, 1975.
13. Tourlakis, G., On the computation of functions by a parallel computer, Symposium on New Directions and Recent Results in Algorithms and Complexity, Carnegie-Mellon University, April 7-9, 1976.
14. Savitch, W. J. and Stimson, M. J., The complexity of time bounded recursive computations, Proceedings 1976 Conference on Information Sciences and Systems, Johns Hopkins University, 42-46.
15. Kozen, D., On parallelism in Turing machines, this volume. Also Tech. Report TR 76-282, Computer Science Dept., Cornell University, 1976.
16. Hopcroft, J. E. and Ullman, J. D., Formal Languages and Their Relation to Automata, Addison-Wesley, Reading, Mass., 1969.
17. Hartmanis, J. and Stearns, R. E., On the computational complexity of algorithms, Trans. AMS 117(1965), 285-306.
18. th IEEE Symposium on Switching Circuit Theory and Logical Design (1965), 179-190.
19. Book, R. V., Greibach, S. A. and Wegbreit, B., Time and tape bounded Turing acceptors and AFL's, J. Comput. Syst. Sci. 4(1970), 606-621.
20. Cook, S. A., Characterizations of pushdown machines in terms of time bounded computers, JACM 18(1971), 4-18.
21. Jones, N. D., Space-bounded reducibility among combinatorial problems, J. Comput. Syst. Sci 11(1975), 68-85.
22. th Annual ACM Symposium on Theory of Computing, May 1973, Austin, 1-9.
23. Aho, A. V., Hopcroft, J. E. and Ullman, J. D., The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974.
24. Stockmeyer, L. J., The polynomial-time hierarchy, IBM Research Report RC5379, 1975; Theoretical Computer Science, to appear.
25. Tseitin, G. S., On the complexity of derivation in propositional calculus, in: Studies in Constructive Mathematics and Mathematical Logic, Part II, A. O. Slisenko, ed., Steklov Math. Institute, Leningrad, 1968; in Russian; English Transl.: Consultants Bureau, New York, 1970, 115-125.
26. Bauer, M., Brand, D., Fischer, M., Meyer, A. and Paterson, M., A note on disjunctive form tautologies, SIGACT NEWS. 5 (April 1973), 17-20.
27. Cook, S. A., An observation on time-storage trade off, J. Cornput. Syst. Sci. 9(1974), 308-316.
28. th Annual ACM Symposium on Theory of Computing, May 1974, Seattle, 40-46.
29. Fischer, M. J. and Rabin, M. O., Super-exponential complexity of Presburger arithmetic, in: Complexity of Computation, R. Karp, ed., Proceedings SIAM-AMS Symposium in Applied Math., 1974.
30. Kleitman, D. and Markowsky, G., On Dedekind's problem: the number of isotone boolean functions II, Trans. AMS 213(1975), 373-390.
31. th Annual Symposium on Switching and Automata Theory, October 1971, 188-191.