An oracle separating ΘP from PPPH☆
References (10)
- et al.
Threshold circuits of bounded depth
Proc. 28th Annual IEEE Symposium on Foundations of Computer Science
(1987) On the computational power of PP and ΘP
Proc. 30th IEEE Symposium on Foundations of Computer Science
(1989)Relativized counting classes: relations among thresholds, parity, and mods
Johns Hopkins Preprint
(1988)- also: J. Comput. System Sci., to... et al.
Relative to a random oracle A PA ≠ NPA ≠ co-NPA with probability 1
SIAM J. Comput.
(1981) With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy
J. Comput. System Sci.
(1989)
There are more references available in the full text version of this article.
Cited by (12)
Relating polynomial time to constant depth
1998, Theoretical Computer ScienceA Lower Bound for Perceptrons and an Oracle Separation of the PP<sup>PH</sup> Hierarchy
1998, Journal of Computer and System SciencesA complex-number Fourier technique for lower bounds on the mod-m degree
2000, Computational ComplexityExponential sums and circuits with a single threshold gate and mod-gates
1999, Theory of Computing SystemsImmunity and simplicity for exact counting and other counting classes
1999, Theoretical Informatics and ApplicationsA lower bound for perceptrons and an oracle separation of the PP<sup>PH</sup> hierarchy
1997, Proceedings of the Annual IEEE Conference on Computational Complexity
- ☆
A preliminary version of this paper appeared in the Fifth Annual Conference on Structure in Complexity Theory. IEEE Computer Society Press, 1990.
Copyright © 1991 Published by Elsevier B.V.