Skip to main content
SpringerLink
Log in
Book cover

International Conference on Foundations of Software Technology and Theoretical Computer Science

FSTTCS 1991: Foundations of Software Technology and Theoretical Computer Science pp 261–265Cite as

Is BP.⊕\(\mathcal{P}\)a probabilistic class?

  • Conference paper
  • First Online:

  • 136 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 560))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Babai, L., and Fortnow, L., A Characterization of \(\mathcal{P}\)by Arithmetic Straight Line Programs, Proc. 31st annual FOCS Symposium,(1990), 26–34.

    Google Scholar 

  2. Lautemann, C., \(\mathcal{B}\mathcal{P}\mathcal{P}\)and the Polynomial Hierarchy, Information Processing Letters, 17, (1983), 215–217.

    Article  Google Scholar 

  3. Ravi Kannan, Venkateswaran, H., Vinay, V., and Yao, A. C., A Circuit-Based Proof of Toda's Theorem, To appear in Information and Computation.

    Google Scholar 

  4. Regan, K. W., Royer J. S., A Simpler Proof of \(\mathcal{P}\mathcal{H} \subseteq BP. \oplus \mathcal{P}\). Draft, May 1990.

    Google Scholar 

  5. Ruzzo, W.L., On Uniform Circuit Complexity, Journal of Computer and System Sciences 22, (1981), 365–383.

    Article  Google Scholar 

  6. Sipser, M., A Complexity-theoretic Approach to Randomness, Proc. 15th STOC, (1983), 330–335.

    Google Scholar 

  7. Toda, S., On the computational power of PP and ⊕\(\mathcal{P}\), Proc. 30th annual FOCS symposium, (1989), 514–519.

    Google Scholar 

  8. Toran, J., An Oracle Characterization of the Counting Hierarchy, Proc. 3rd Structure in Complexity Theory Conference, (1988).

    Google Scholar 

  9. Toran, J., Counting the Number of Solutions, Tech rep. LSI-90-17, Department de Llenguatges i sistemes informatics, Universitat Politecnica de Catalunya.

    Google Scholar 

  10. L.G. Valiant and V.V. Vazirani, NP is as easy as detecting unique solutions, Theoretical Computer Science 47, (1986), 85–93.

    Article  Google Scholar 

  11. 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.

    Google Scholar 

  12. Venkateswaran, H., Personal Communication.

    Google Scholar 

  13. Vinay,V.,Venkateswaran, H., and Veni Madhavan,C.E., Circuits, Pebbling and Express ibility, Proc. 5th Structure in Complexity Theory Conference, (1990), 223–230.

    Google Scholar 

  14. Wagner, K., The Complexity of Combinatorial Problems with Succint Input Representation, Ada Informatica 23, (1986), 325–356.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science and Automation, Indian Institute of Science, 560 012, Bangalore, India

    V Vinay

Authors
  1. V Vinay
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Somenath Biswas Kesav V. Nori

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation