Probabilistic quantifiers vs. distrustful adversaries

  • Stathis Zachos
  • Martin Furer
Session 8 Theory Of Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 287)


Turing Machine Complexity Class Probabilistic Quantifier Matrix Group Exact Order 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

8. References

  1. [B 85]
    BABAI, L., Trading Group Theory for Randomness, 17th STOC, (1985), 421–429.Google Scholar
  2. [BE 82]
    BABAI, L., and ERDOS, P., Representation of Group Elements as as short Products, in: Theory and Practice of Combinatorics (A. Rosa et al. eds.), Annals of Discr. Math. 12, (1982), 27–30.Google Scholar
  3. [BG 81]
    BENNETT, C.H., and GILL, J., Relative to a Random Oracle A, P ANP AcoNP A, SIAM J. Comput 10, (1981), 96–113.CrossRefGoogle Scholar
  4. [BHZ 86]
    BOPPANA, R.B., HASTAD, J., and ZACHOS, S., Does co-NP have Short Interactive Proofs?, (1986), IPL 25, (1987), 127–132.CrossRefGoogle Scholar
  5. [BS 84]
    BABAI, L.., and SZEMEREDI, E., On the Complexity of Matrix Group Problems I, FOCS 25, (1984), 229–240.Google Scholar
  6. [FHL 80]
    FURST, M.L., HOPCROFT, J., and LUKS, E.M., Polynomial-time Algorithms for Permutation Groups, 21st FOCS, (1980), 36–41.Google Scholar
  7. [FS]
    FORTNOW, L., and SIPSER, M., Private Communication.Google Scholar
  8. [G 77]
    GILL, J., Computational Complexity of Probabilistic Turing Machines, SIAM J. of Computing 6, (1977), 675–695.CrossRefGoogle Scholar
  9. [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
  10. [GMR 85]
    GOLDWASSER, S., MICALI, S., and RACKOFF, C., The Knowledge Complexity of Interactive Proof Systems, 17th STOC, (1985), 291–304.Google Scholar
  11. [GS 85]
    GOLDWASSER, S., and SIPSER, M., Private Coins versus Public Coins in Interactive Proof Systems, 18th STOC, (1986), 59–68.Google Scholar
  12. [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
  13. [P 83]
    PAPADIMITRIOU, C.H., Games against Nature, 24th FOCS, (1983), 446–450.Google Scholar
  14. [PY 82]
    PAPADIMITRIOU, C.H., and YANNAKAKIS, M., The Complexity of Facets (and some facets of complexity), 14th STOC, (1982), 255–260.Google Scholar
  15. [S 76]
    STOCKMEYER, L.J., The Polynomial-Time Hierarchy, TCS 3, (1976), 1–22.CrossRefGoogle Scholar
  16. [Sc 86]
    SCHOENING, U., Graph Isomorphism is in the Low Hierarchy, (1986), submitted for publication.Google Scholar
  17. [Si 78]
    SIMS, C.C., Some Group Theoretic Algorithms, Lect. Notes in Math. 697, Springer-Verlag, (1978), 108–124.Google Scholar
  18. [SS 77]
    SOLOVAY, R., and STRASSEN, V., A fast Monte-Carlo test for primality, SIAM J. of Computing 6, (1977) 84–85.CrossRefGoogle Scholar
  19. [W 76]
    WRATHALL, C., Complete Sets and the Polynomial-Time Hierarchy, TCS 3, (1976), 23–33.CrossRefGoogle Scholar
  20. [Z 82]
    ZACHOS, S., Robustness of Probabilistic Computational Complexity Classes under Definional Perturbations, Information and Control, (1982), 54, 143–154.CrossRefGoogle Scholar
  21. [ZH 83]
    ZACHOS, S., and HELLER, H., On BPP, TM-252, LCS, MIT, (1983).Google Scholar
  22. [ZH 84]
    ZACHOS, S., and HELLER, H., A Decisive Characterization of BPP, Information and Control, (1986), 69, 125–135.CrossRefGoogle Scholar
  23. [Z 86]
    ZACHOS, S., Probabilistic Quantifiers, Adversaries, and Complexity Classes: An Overview, Proceedings of Structure in Complexity Theory Conference, Lecture Notes in Computer Science, 223, (1986), 383–400.Google Scholar
  24. [Za 86]
    ZACHOS, S., Probabilistic Oracles are less Powerfull than Nondeterministic Oracles, submitted for publication, (1986).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Stathis Zachos
    • 1
  • Martin Furer
    • 2
  1. 1.Brooklyn College of CUNYNew York
  2. 2.University of ZurichSwitzerland

Personalised recommendations