On Type-2 Probabilistic Quantifiers

We define and examine several probabilistic operators ranging over sets (i.e., operators of type 2), among others the formerly studied ALMOST-operator. We compare their power and prove that they all coincide for a wide variety of classes. As a consequence, we characterize the ALMOST-operator which ranges over infinite objects (sets) by a bounded-error probabilistic operator which ranges over strings, i.e. finite objects. This leads to a number of consequences about complexity classes of current interest. As applications, we obtain (a) a criterion for measure 1 inclusions of complexity classes, (b) a criterion for inclusions of complexity classes relative to a random oracle, (c) a new upper time bound for ALMOST-PSPACE, and (d) a characterization of ALMOST-PSPACE in terms of checking stack automata. Finally, a connection between the power of ALMOST-PSPACE and that of probabilistic NC1 circuits is given.

[1]  Pierluigi Crescenzi,et al.  A Uniform Approach to Define Complexity Classes , 1992, Theor. Comput. Sci..

[2]  C. Papadimitriou,et al.  Two remarks on the power of counting , 1983 .

[3]  Noam Nisan,et al.  Hardness vs Randomness , 1994, J. Comput. Syst. Sci..

[4]  László Babai,et al.  Trading group theory for randomness , 1985, STOC '85.

[5]  Stephen A. Cook,et al.  A Taxonomy of Problems with Fast Parallel Algorithms , 1985, Inf. Control..

[6]  Jin-Yi Cai,et al.  With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy , 1986, STOC '86.

[7]  John Gill,et al.  Relative to a Random Oracle A, PA != NPA != co-NPA with Probability 1 , 1981, SIAM J. Comput..

[8]  Pekka Orponen,et al.  Complexity Classes of Alternating Machines with Oracles , 1983, ICALP.

[9]  Steven M. Kautz.  Degrees of random sets , 1991 .

[10]  Klaus W. Wagner,et al.  Some Observations on the Connection Between Counting an Recursion , 1986, Theor. Comput. Sci..

[11]  Noam Nisan.  On Read-Once vs. Multiple Access to Randomness in Logspace , 1993, Theor. Comput. Sci..

[12]  Celia Wrathall,et al.  Complete Sets and the Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[13]  U. Schoning.  Probalisitic complexity classes and lowness , 1989 .

[14]  José L. Balcázar,et al.  Structural Complexity I , 1995, Texts in Theoretical Computer Science An EATCS Series.

[15]  Ronald V. Book,et al.  Tally Languages and Complexity Classes , 1974, Inf. Control..

[16]  Janos Simon.  On some central problems in computational complexity , 1975 .

[17]  Clemens Lautemann,et al.  BPP and the Polynomial Hierarchy , 1983, Inf. Process. Lett..

[18]  Oscar H. Ibarra,et al.  Characterizations of Some Tape and Time Complexity Classes of Turing Machines in Terms of Multihead and Auxiliary Stack Automata , 1971, J. Comput. Syst. Sci..

[19]  John Gill,et al.  Computational Complexity of Probabilistic Turing Machines , 1977, SIAM J. Comput..

[20]  Seinosuke Toda,et al.  PP is as Hard as the Polynomial-Time Hierarchy , 1991, SIAM J. Comput..

[21]  Klaus Ambos-Spies,et al.  Randomness, Relativizations, and Polynomial Reducibilities , 1986, SCT.

[22]  Michael Sipser,et al.  A complexity theoretic approach to randomness , 1983, STOC.

[23]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[24]  Noam Nisan,et al.  Pseudorandom generators for space-bounded computation , 1992, Comb..

[25]  Ronald V. Book.  On Languages Reducible to Algorithmically Random Languages , 1994, SIAM J. Comput..

[26]  Neil Immerman,et al.  On Uniformity within NC¹ , 1990, J. Comput. Syst. Sci..

[27]  Thomas Schwentick,et al.  On the power of polynomial time bit-reductions , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.