This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Babai, L., and Fortnow, L., A Characterization of \(\mathcal{P}\)by Arithmetic Straight Line Programs, Proc. 31st annual FOCS Symposium,(1990), 26–34.
Lautemann, C., \(\mathcal{B}\mathcal{P}\mathcal{P}\)and the Polynomial Hierarchy, Information Processing Letters, 17, (1983), 215–217.
Ravi Kannan, Venkateswaran, H., Vinay, V., and Yao, A. C., A Circuit-Based Proof of Toda's Theorem, To appear in Information and Computation.
Regan, K. W., Royer J. S., A Simpler Proof of \(\mathcal{P}\mathcal{H} \subseteq BP. \oplus \mathcal{P}\). Draft, May 1990.
Ruzzo, W.L., On Uniform Circuit Complexity, Journal of Computer and System Sciences 22, (1981), 365–383.
Sipser, M., A Complexity-theoretic Approach to Randomness, Proc. 15th STOC, (1983), 330–335.
Toda, S., On the computational power of PP and ⊕\(\mathcal{P}\), Proc. 30th annual FOCS symposium, (1989), 514–519.
Toran, J., An Oracle Characterization of the Counting Hierarchy, Proc. 3rd Structure in Complexity Theory Conference, (1988).
Toran, J., Counting the Number of Solutions, Tech rep. LSI-90-17, Department de Llenguatges i sistemes informatics, Universitat Politecnica de Catalunya.
L.G. Valiant and V.V. Vazirani, NP is as easy as detecting unique solutions, Theoretical Computer Science 47, (1986), 85–93.
Venkateswaran, H., Circuit definitions of nondeterministic complexity classes, Proc. 8th Annual conference on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, Vol. 338, 175–192.
Venkateswaran, H., Personal Communication.
Vinay,V.,Venkateswaran, H., and Veni Madhavan,C.E., Circuits, Pebbling and Express ibility, Proc. 5th Structure in Complexity Theory Conference, (1990), 223–230.
Wagner, K., The Complexity of Combinatorial Problems with Succint Input Representation, Ada Informatica 23, (1986), 325–356.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vinay, V. (1991). Is BP.⊕\(\mathcal{P}\)a probabilistic class?. In: Biswas, S., Nori, K.V. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1991. Lecture Notes in Computer Science, vol 560. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54967-6_73
Download citation
DOI: https://doi.org/10.1007/3-540-54967-6_73
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54967-3
Online ISBN: 978-3-540-46612-3
eBook Packages: Springer Book Archive