This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
8. References
BABAI, L., Trading Group Theory for Randomness, 17th STOC, (1985), 421–429.
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.
BENNETT, C.H., and GILL, J., Relative to a Random Oracle A, P A ≠ NP A ≠ co −NP A, SIAM J. Comput 10, (1981), 96–113.
BOPPANA, R.B., HASTAD, J., and ZACHOS, S., Does co-NP have Short Interactive Proofs?, (1986), IPL 25, (1987), 127–132.
BABAI, L.., and SZEMEREDI, E., On the Complexity of Matrix Group Problems I, FOCS 25, (1984), 229–240.
FURST, M.L., HOPCROFT, J., and LUKS, E.M., Polynomial-time Algorithms for Permutation Groups, 21st FOCS, (1980), 36–41.
FORTNOW, L., and SIPSER, M., Private Communication.
GILL, J., Computational Complexity of Probabilistic Turing Machines, SIAM J. of Computing 6, (1977), 675–695.
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.
GOLDWASSER, S., MICALI, S., and RACKOFF, C., The Knowledge Complexity of Interactive Proof Systems, 17th STOC, (1985), 291–304.
GOLDWASSER, S., and SIPSER, M., Private Coins versus Public Coins in Interactive Proof Systems, 18th STOC, (1986), 59–68.
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.
PAPADIMITRIOU, C.H., Games against Nature, 24th FOCS, (1983), 446–450.
PAPADIMITRIOU, C.H., and YANNAKAKIS, M., The Complexity of Facets (and some facets of complexity), 14th STOC, (1982), 255–260.
STOCKMEYER, L.J., The Polynomial-Time Hierarchy, TCS 3, (1976), 1–22.
SCHOENING, U., Graph Isomorphism is in the Low Hierarchy, (1986), submitted for publication.
SIMS, C.C., Some Group Theoretic Algorithms, Lect. Notes in Math. 697, Springer-Verlag, (1978), 108–124.
SOLOVAY, R., and STRASSEN, V., A fast Monte-Carlo test for primality, SIAM J. of Computing 6, (1977) 84–85.
WRATHALL, C., Complete Sets and the Polynomial-Time Hierarchy, TCS 3, (1976), 23–33.
ZACHOS, S., Robustness of Probabilistic Computational Complexity Classes under Definional Perturbations, Information and Control, (1982), 54, 143–154.
ZACHOS, S., and HELLER, H., On BPP, TM-252, LCS, MIT, (1983).
ZACHOS, S., and HELLER, H., A Decisive Characterization of BPP, Information and Control, (1986), 69, 125–135.
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.
ZACHOS, S., Probabilistic Oracles are less Powerfull than Nondeterministic Oracles, submitted for publication, (1986).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zachos, S., Furer, M. (1987). Probabilistic quantifiers vs. distrustful adversaries. In: Nori, K.V. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1987. Lecture Notes in Computer Science, vol 287. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18625-5_67
Download citation
DOI: https://doi.org/10.1007/3-540-18625-5_67
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18625-0
Online ISBN: 978-3-540-48033-4
eBook Packages: Springer Book Archive