Advertisement

Probabilistic quantifiers, adversaries, and complexity classes : An overview

  • Stathis Zachos
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 223)

Abstract

We consider inclusion relations among a multitude of classical complexity classes and classes with probabilistic components. A key tool is a method for characterizing such classes in terms of the ordinary quantifiers ∃ and ∀ together with a quantifier ∃+, which means roughly “for most”, applied to polynomial-time predicates. This approach yields a uniform treatment which leads to easier proofs for class-inclusion and hierarchy-collapse results. Furthermore the method captures some recently introduced game classes and game hierarchies.

This survey also includes a charting of class-inclusion and oracle-based separation results.

Keywords

probabilistic algorithms complexity classes polynomial time quantifiers combinatorial games oracles and hierarchies 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

8. References

  1. [An 80]
    ANGLUIN, D., On counting problems and the polynomial time hierarchy, TCS 12, (1980), 161–173.Google Scholar
  2. [B 85]
    BABAI, L., Trading Group Theory for Randomness, 17th STOC, (1985), 421–429.Google Scholar
  3. [BG 81]
    BENNETT, C.H., and GILL, J., Relative to Random Oracle A, PA ≠ NPA ≠ co-NPA, SIAM J. Comput 10, (1981), 96–113.CrossRefGoogle Scholar
  4. [BGS 73]
    BAKER, T., GILL, J., and SOLOVAY, R., Relativization of the P=? NP question, SIAM J. of Computing 4, (1975), 431–442.Google Scholar
  5. [BMS 84]
    BACH, E., MILLER, G., and SHALLIT, J., Sums of divisors, perfect numbers, and factoring, 16th STOC, (1984), 183–190.Google Scholar
  6. [BS 79]
    BAKER, T., and SELMAN, A., A second step toward the polynomial hierarchy, TCS 8, (1979), 177–187.Google Scholar
  7. [G 77]
    GILL, J., Computational Complexity of Probabilistic Turing Machines, SIAM J. of Computing 6, (1977), 675–695.Google Scholar
  8. [GHY 85]
    GALIL, Z., HABER, S., and YUNG, M., A Private Interactive Test of a Boolean Predicate and Minimum — Knowledge Public — Key Cryptosystems, 26th FOCS, (1985), 360–371.Google Scholar
  9. [GMR 85]
    GOLDWASSER, S., MICALI, S., and RACKOFF, C., The Knowledge Complexity of Interactive Proof Systems, 17th STOC, (1985), 291–304.Google Scholar
  10. [GS 85]
    GOLDWASSER, S., and SIPSER, M., Arthur Merlin Games versus Interactive Proof Systems, 18th STOC, (1986).Google Scholar
  11. [He 85]
    HELLER, H., On relativized exponential and probabilistic complexity classes, (1985), submitted to Information and Control.Google Scholar
  12. [Hu 78]
    HUNT, J.W., Topics in Probabilistic Complexity, Ph.D. Dissertation, Department of Electrical Engineering, Stanford, (1978).Google Scholar
  13. [HZ 84]
    HINMAN, P. and ZACHOS, S., Probabilistic Machines, Oracles and Quantifiers, Proceedings of the Oberwolfach Recursion-theoretic Week, Lecture Notes in Mathematics, 1141, Springer-Verlag, (1984), 159–192.Google Scholar
  14. [Ko 82]
    KER-I-KO, Some Observations on Probabilistic Algorithms and NP-Hard Problems, IPL 14, (1982), 39–43.Google Scholar
  15. [P 83]
    PAPADIMITRIOU, C.H., Games against Nature, 24th FOCS, (1983), 446–450.Google Scholar
  16. [PY 82]
    PAPADIMITRIOU, C.H., and YANNAKAKIS, M., The Complexity of Facets (and some facets of complexity), 14th STOC, (1982), 255–260.Google Scholar
  17. [Rab 80]
    RABIN, M., Probabilistic Algorithm for Testing Primality, J. of Number Theory 12, (1980), 128–138.Google Scholar
  18. [Rac 82]
    RACKOFF, C., Relativized questions involving probabilistic algorithms, JACM 29, (1982), 261–268.Google Scholar
  19. [S 76]
    STOCKMEYER, L.J., The Polynomial-Time Hierarchy, TCS 3, (1976), 1–22.CrossRefGoogle Scholar
  20. [SS 77]
    SOLOVAY, R., and STRASSEN, V., A fast Monte-Carlo test for primality, SIAM J. of Computing 6, (1977) 84–85.Google Scholar
  21. [VV 85]
    VAZIRANI, U.V., and VAZIRANI, V.V., Random polynomial time is equal to slightly random polynomial time, 26th FOCS, (1985), 417–428.Google Scholar
  22. [W 76]
    WRATHALL, C., Complete sets and the polynomial-time hierarchy, TCS 3, (1976), 23–33.Google Scholar
  23. [Ya 85]
    YAO, A.C., Separating the Polynomial — Time Hierarchy by Oracles, 26th FOCS, (1985), 1–10.Google Scholar
  24. [Z 82]
    ZACHOS, S., Robustness of Probabilistic Computational Complexity Classes under Definitional Perturbations, Information and Control, (1982), 54, 143–154.Google Scholar
  25. [Z 83]
    ZACHOS, S., Collapsing probabilistic polynomial hierarchies, Proc. Conf. on Computational Complexity Theory, Santa Barbara, (1983), 75–81.Google Scholar
  26. [ZF 85]
    ZACHOS, S., and FURER, M., Probabilistic Quantifiers vs. Distrustful Adversaries, (1985), submitted for publication.Google Scholar
  27. [ZH 83]
    ZACHOS, S., and HELLER, H., On BPP, TM-252, LCS, MIT, (1983).Google Scholar
  28. [ZH 84]
    ZACHOS, S., and HELLER, H., A Decisive Characterization of BPP, (1984), to appear in Information and Control.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Stathis Zachos
    • 1
  1. 1.Brooklyn College of CUNYNew York

Personalised recommendations