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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BF 90]
    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. [La 83]
    Lautemann, C., \(\mathcal{B}\mathcal{P}\mathcal{P}\)and the Polynomial Hierarchy, Information Processing Letters, 17, (1983), 215–217.CrossRefGoogle Scholar
  3. [RVVY 90]
    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. [RR 90]
    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. [Ru 81]
    Ruzzo, W.L., On Uniform Circuit Complexity, Journal of Computer and System Sciences 22, (1981), 365–383.CrossRefGoogle Scholar
  6. [Si 83]
    Sipser, M., A Complexity-theoretic Approach to Randomness, Proc. 15th STOC, (1983), 330–335.Google Scholar
  7. [To 89]
    Toda, S., On the computational power of PP and ⊕\(\mathcal{P}\), Proc. 30th annual FOCS symposium, (1989), 514–519.Google Scholar
  8. [Tr 88]
    Toran, J., An Oracle Characterization of the Counting Hierarchy, Proc. 3rd Structure in Complexity Theory Conference, (1988).Google Scholar
  9. [Tr 90]
    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. [VV 86]
    L.G. Valiant and V.V. Vazirani, NP is as easy as detecting unique solutions, Theoretical Computer Science 47, (1986), 85–93.CrossRefGoogle Scholar
  11. [Ve 88]
    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. [Ve]
    Venkateswaran, H., Personal Communication.Google Scholar
  13. [VVV 90]
    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. [Wa 86]
    Wagner, K., The Complexity of Combinatorial Problems with Succint Input Representation, Ada Informatica 23, (1986), 325–356.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag 1991

Authors and Affiliations

  • V Vinay
    • 1
  1. 1.Dept. of Computer Science and AutomationIndian Institute of ScienceBangaloreIndia

Personalised recommendations