Advertisement

A new characterization of BPP

  • Stathis Zachos
  • Hans Heller
Session 3 Theory
Part of the Lecture Notes in Computer Science book series (LNCS, volume 181)

Abstract

The complexity class BPP contains languages that can be solved in polynomial time with bounded error probability. It is shown that a language L is in BPP iff (x∈L ↔ ∃my ∀z P(x,y,z)) and (x∉L ↔ ∀y ∃mz⌍P(x,y,z)) for a polynomial time predicate P and for |y|, |z| ≦ poly(|x|). The formula ∃myP(y) with the random quantifier ∃m means that the probability Pr({y| P(y)}) <1/2 + ɛ for a fixed ɛ. Note that the weaker conditions ∃ y ∀zP(x,y,z) and ∀ y ∃ z⌍P(x,y,z) are complementary and thus decide whether x∈L. Some of the consequences of the characterization of BPP are that various probabilistic polynomial time hierarchies collapse as well as that probabilistic oracles do not add anything to the computing power of classes as low as Σ 2 P . For example, Σ 2 P, BPP = Σ 2 P , where Σ 2 P, BPP is the class σ 2 P relativized to BPP.

Keywords

Probalistic algorithms polynomial time complexity classes oracles polynomial hierarchies 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

4. References

  1. [A]
    Adleman, L. (1978), Two Theorems on Random Polynomial Time, FOCS 19, 75–83Google Scholar
  2. [BG]
    Bennet, C.H., and Gill, J. (1981), Relative to a Random Oracle A PA ≠ NPA ≠ co-NPA with Probability 1, SIAM J. Comput. 10, 96–112Google Scholar
  3. [CKS]
    Chandra, A.K., Kozen, D.C., and Stockmeyer, L.J. (1981), Alternation, JACM 28, 114–133Google Scholar
  4. [GJ]
    Garey, M.R., and Johnson, D.S., (1979), Computers and Intractability: a Guide to the Theory of NP-Completeness, Freeman, San FranciscoGoogle Scholar
  5. [G]
    Gill, J., (1977), Computational Complexity of Probabilistic Turing Machines, SIAM J. Comput. 6, 675–695Google Scholar
  6. [HU]
    Hopcroft, J.E., and Ullman, J.D., (1979), Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, Mass.Google Scholar
  7. [K]
    Ko, Ker-I, (1982), Some Observations on Probabilistic Algorithms and NP-Hard Problems, Inf. Proc. Let. 14, 39–43Google Scholar
  8. [L]
    Lautemann, C., (1983), BPP and the Polynomial Hierarchy, Techn. Uni. Berlin, Informatik, Report 83-06Google Scholar
  9. [Si]
    Sipser, M., (1983), A Complexity Theoretic Approach to Randomness, STOC 15, 330–335Google Scholar
  10. [St]
    Stockmeyer, L.J., (1976), Complete Sets and the Polynomial Hierarchy, Theoret. Comp. Science 3, 23–33Google Scholar
  11. [Z1]
    Zachos, S., (1982), Robustness of Probabilistic Complexity Classes under Definitional Perturbations, Information and Control 54, 143–154Google Scholar
  12. [Z2]
    Zachos, S., (1983), Collapsing Probabilistic Polynomial Hierarchies, Conf. on Comp. Compl. Th., S. Barbara, 75–81Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Stathis Zachos
    • 1
  • Hans Heller
    • 2
  1. 1.Dept. of Comp. and Inf. Sci.Brooklyn College of the City University of New YorkBrooklyn
  2. 2.Techn. Universität MünchenMünchenW-Germany

Personalised recommendations