On type-2 probabilistic quantifiers

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

Volumn 1099, Issue , 1996, Pages 369-380

  Book, Ronald V ^a   Vollmer, Heribert ^b   Wagner, Klaus W ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF WÜRZBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

BOUNDED ERRORS; COMPLEXITY CLASS; INFINITE OBJECTS; PROBABILISTIC OPERATOR; RANDOM ORACLE; UPPER TIME BOUNDS;

COMPUTATIONAL COMPLEXITY;

EID: 84947707569     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61440-0_143     Document Type: Conference Paper

References (33)

1. K. Ambos-Spies, Randomness, relativizations, and polynomial reducibilities, Proceedings of the 1st Structure in Complexity Theory Conference (1986), Springer Lecture Notes in Computer Science Vol. 223, pp. 200-207.
2. L. Babai, Trading group theory for randomness; Proceedings of the 17th Symposium on Foundations of Computer Science (1975), pp. 421-429.
3. J. L. Balcäzar, J. Di az, J. Gabarró, Structural Complexity I Springer Verlag, Berlin - Heidelberg - New York,(1995).
4. 1; Journal of Computer and System Sciences 41 (1990), pp. 274-306.
5. A with probability 1; SIAM J. Comput. 10 (1981), pp. 96-113.
6. R. V. Book, Tally languages and complexity classes; Information and Control 26 (1974), pp. 186-193.
7. R. V. Book, On languages reducible to algorithmically random languages; SIAM J. Comput. 23 (1994), pp. 1275-1282.
8. R. V. Book, J. H. Lutz, К. W. Wagner, An observation on probability versus randomness with applications to complexity classes; Mathematical Systems Theory 27 (1994), pp. 201-209.
9. D. P. Bovet, P. Crescenzi, R. Silvestri, A uniform approach to define complexity classes; Theoretical Computer Science 104 (1992), pp. 263-283.
10. J. Y. Cai, With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy; Journal of Computer and System Sciences 38 (1989), pp. 68-85.
11. S. A. Cook, A taxonomy of problems with fast parallel algorithms; Information and Control 64 (1985), pp. 2-22.
12. J. Gill, Computational complexity of probabilistic complexity classes; SIAM Journal on Computing 6 (1977), pp. 675-695.
13. U. Hertrampf, C. Lautemann, T. Schwentick, H. Vollmer, K.W. Wagner, On the power of polynomial time bit-reductions; Proceedings of the 8th Structure in Complexity Theory Conference (1993), pp. 200-207.
14. O. H. Ibarra, Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata; Journal of Computer and System Sciences 5 (1971), pp. 88-117.
15. S. Kautz, Degrees of random sets; Ph. D. dissertation, Cornell University, 1991.
16. C. Lautemann, BPP and the polynomial hierarchy; Information Processing Letters 117 (1983), pp. 215-217.
17. J. Lutz, personal communication, 1995.
18. W. Merkle, Y. Wang, Separations by random oracles and "Almost" classes for generalized reducibilities; Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science (1995), Springer Lecture Notes in Computer Science Vol. 969, pp. 179-190.
19. N. Nisan, A. Wigderson, Hardness vs. Randomness; Journal of Computer and System Sciences 49 (1994), pp. 149-167.
20. N. Nisan, Pseudorandom generators for space-bounded computation; Journal of Combinatorica 12 (1992), pp. 449-461.
21. N. Nisan, On read-once vs. multiple access to randomness in logspace; Theoretical Computer Sience 107 (1993), pp. 135-144.
22. P. Orponen, Complexity classes of alternating machines with oracles; Proceedings of the 10th International Colloquium on Automata, Languages and Programming (1983), Springer Lecture Notes in Computer Science Vol. 154, pp. 573-584.
23. C. H. Papadimitriou, S. K. Zachos, Two remarks on the power of counting; Proceedings of the 6th Gl-Conference on Theoretical Computer Science (1983), Springer Lecture Notes in Computer Science Vol. 145, pp. 269-275.
24. K. W. Regan, J. S. Royer, On closure properties of bounded two-sided error complexity classes; Mathematical Systems Theory 28 (1995), pp. 229-243.
25. H. Rogers, Theory of Recursive Functions and Effective Computability (McGraw-Hill, New York, NY, 1967).
26. U. Schöning, Probabilistic complexity classes and lowness; Journal of Computer and System Sciences 39 (1989), pp. 84-100.
27. J. Simon, On Some Central Problems in Computational Complexity; Dissertation, Cornell University (1975).
28. M. Sipser, A complexity theoretic approach to randomness; Proceedings of the 15th Symposium on Theory of Computing (1983), pp. 330-335.
29. S. Toda, PP is as hard as the polynomial time hierarchy; SIAM Journal on Computing 20 (1991) 865-877.
30. K. W. Wagner, Some observations on the connection between counting and recursion; Theoretical Computer Science 47 (1986), pp. 131-147.
31. K. W. Wagner, High-order operators in complexity theory; manuscript.
32. K. W. Wagner, G. Wechsung, Computational Complexity (Deutscher Verlag der Wissenschaften, Berlin, 1986).
33. C. Wrathall, Complete sets and the polynomial-time hierarchy; Theoretical Computer Science 3 (1977), pp. 23-33.