Randomness, Tally Sets, and Complexity Classes

[1]  Richard J. Lipton,et al.  Some connections between nonuniform and uniform complexity classes , 1980, STOC '80.

[2]  José L. Balcázar,et al.  The polynomial-time hierarchy and sparse oracles , 1986, JACM.

[3]  Stephen R. Mahaney.  Sparse Complete Sets of NP: Solution of a Conjecture of Berman and Hartmanis , 1982, J. Comput. Syst. Sci..

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

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

[6]  Shouwen Tang,et al.  Separating Polynomial-Time Turing and Truth-Table Reductions by Tally Sets , 1988, ICALP.

[7]  Stuart A. Kurtz,et al.  On the random oracle hypothesis , 1982, STOC '82.

[8]  R.E. Ladner,et al.  A Comparison of Polynomial Time Reducibilities , 1975, Theor. Comput. Sci..

[9]  Timothy J. Long,et al.  Relativizing complexity classes with sparse oracles , 1986, JACM.

[10]  Juris Hartmanis,et al.  On polynomial time isomorphisms of complete sets , 1977, Theoretical Computer Science.

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

[12]  Eric Allender,et al.  P-Printable Sets , 1988, SIAM J. Comput..

[13]  László Babai,et al.  Random Oracles Separate PSPACE from the Polynomial-Time Hierarchy , 1987, Inf. Process. Lett..

[14]  R. Solovay,et al.  Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question , 1975 .

[15]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[16]  Stathis Zachos,et al.  Probabalistic Quantifiers vs. Distrustful Adversaries , 1987, FSTTCS.

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

[18]  Ker-I Ko,et al.  Some Observations on the Probabilistic Algorithms and NP-hard Problems , 1982, Inf. Process. Lett..

[19]  Osamu Watanabe,et al.  Kolmogorov complexity and degrees of tally sets , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

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

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

[22]  Juris Hartmanis.  Solvable problems with conflicting relativizations , 1985, Bull. EATCS.

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

[24]  Ker-I Ko,et al.  On sets reducible to sparse sets , 1987, Computational Complexity Conference.

[25]  Osamu Watanabe,et al.  On tally relativizations of BP-complexity classes , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[26]  Neil Immerman,et al.  Sparse sets in NP-P: Exptime versus nexptime , 1983, STOC.

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

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