Complexity classes of alternating machines with oracles

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 154 LNCS, Issue , 1983, Pages 573-584

  Orponen, Pekka ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION;

ALTERNATING MACHINES; ALTERNATING POLYNOMIALS; ALTERNATING TURING MACHINES; COMPLEXITY CLASS; COMPLEXITY HIERARCHIES; COMPLEXITY THEORY; EXPONENTIAL TIME; POLYNOMIAL-TIME HIERARCHY;

TURING MACHINES; AUTOMATA THEORY;

ALTERNATING TURING MACHINES; APSPACE LANGUAGES; COMPLEXITY CLASSES; E LANGUAGES; NONRELATIVIZABILITY; ORACLES;

EID: 0020992843     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0036938     Document Type: Conference Paper

References (16)

1. Angluin, D., On relativizing auxiliary pushdown machines. Math. Systems Theory 13(1980), 283–299.
2. Baker, T., J. Gill and R. Solovay, Relativizations of the P=? NP question. SIAM J. Comput. 4(1975), 431–442.
3. A with probability 1. SIAM J. Comput. 10 (1981), 96–113.
4. Book, R.V., Comparing complexity classes. J. Comput. System Sci. 9 (1974), 213–229.
5. Book, R.V., Bounded query machines: on NP and PSPACE. Theor. Comput. Sci. 15 (1981), 27–29.
6. Chandra, A.K., D.C. Kozen and L.J. Stockmeyer, Alternation. J. Assoc. Comput. Mach. 28(1981), 114–133.
7. Hopcroft, J.E. and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, Mass. (1979).
8. Kurtz, S.A., On the random oracle hypothesis. Proc. 14th Ann. ACM Symp. on Theory of Computing (1982), 224–230.
9. Ladner, R.E. and N.A. Lynch, Relativization of questions about log space computability. Math. Systems Theory 10 (1976), 19–32.
10. Lynch, N.A., Log space machines with multiple oracle tapes. Theor. Comput. Sci. 6 (1978), 25–39.
11. Rogers, H., Jr., Theory of Recursive Functions and Effective Computabitity. McGraw-Hill, New York (1967).
12. Ruzzo, W.L., J. Simon and M. Tompa, Space-bounded hierarchies and probabilistic computations. Proc. 14th Ann. ACM Symp. on Theory of Computing (1982), 215–223.
13. Simon, I., On Some Subrecursive Reducibilities. Ph.D. dissertation. Report STAN-CS-77-608, Dept. of Computer Science, Stanford University, Stanford, Ca. (1977).
14. Simon, J., On Some Central Problems in Computational Complexity. Ph.D. dissertation. Report TR 75-224, Dept. of Computer Science, Cornell University, Ithaca, N.Y. (1975)
15. Sipser, M., On relativizations and existence of complete sets. Proc. 9th Int. Colloq. on Automata, Languages, and Programming, Aarhus, Denmark (1982), 523–531.
16. Stockmeyer, L.J., The polynomial-time hierarchy. Theor. Comput. Sci. 3 (1976), 23–33.