Abstract
We construct an oracleA such that\(\Sigma _2^{P,A} \nsubseteq PP^A \). So the polynomial time hierarchy is separated from the polynomial time probabilistic complexity class in relativization.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Beigel, R., Polynomial interpolation, threshold circuits, and the polynomial hierarchy, Manuscript, 1990.
Beigel, R. Hemachandra, L.A. and Wechsung, G., On the power of probabilistic polynomial time, In proceeding of 4th annual conference on structural complexity theory, 225–227, June 1989.
Minsky, M.L. and Papert, S.A., Perceptrons, MIT Press, Cambridge, MA, 1988.
Papadimitriou, C.H. and Zachos, S.K., Two remarks on the complexity of counting, In the proceeding of the 6th GI conference of theoretical computer science, 269–276, Springer-Verlag, 1983.
Schöning, U. Kober, J. Toda, S. and Toran, J., Turing maachines with few accepting computation and low sets forPP, In proceeding of 4th annual conference on structural complexity theory, 208–215, June 1989.
Toda, S., On The computational power ofPP and ⊕P, In proceedings of the 30th IEEE symposium on foundations of computer science, 514–519, 1989.
Wagner, K.W.,The complexity of combinatorial problems with succint input representation, Acta Informatica,23(1986), 325–356.
Author information
Authors and Affiliations
Additional information
This research is supported in part by HTP863
Rights and permissions
About this article
Cite this article
Bin, F. SeparatingPH fromPP by relativization. Acta Mathematica Sinica 8, 329–336 (1992). https://doi.org/10.1007/BF02582920
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02582920