One-sided versus two-sided error in probabilistic computation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1563, Issue , 1999, Pages 100-109

  Buhrman, Harry ^a   Fortnow, Lance ^b  

^a CWI   (Netherlands)

^b THE UNIVERSITY OF CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

HITTING SET GENERATORS; PROBABILISTIC COMPUTATION;

ARTIFICIAL INTELLIGENCE;

EID: 84874144431     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49116-3_9     Document Type: Conference Paper

References (12)

1. A. Andreev, A. Clement, and J. Rolim. A new derandomization method. Journal of the ACM, 45(1):179-213, Januari 1998.
2. A. Andreev, A. Clement, J. Rolim, and L. Trevisan. Weak random sources, hittings sets, and BPP simulations. In Proceedings of the 38th IEEE Symposium on Foundations of Computer Science, pages 264-272. IEEE, New York, 1997.
3. M. Blum and R. Impagliazzo. Generic oracles and oracle classes. In Proceedings of the 28th IEEE Symposium on Foundations of Computer Scince, pages 118-126. IEEE, New York, 1987.
4. A. Clementi, J. Rolim, and L. Trevisan. Recent advances towards proving BPP = P. Bulletin of the European Association for Theoretical Computer Science, 64:96-103, February 1998.
5. S. Fenner, L. Fortnow, S. Kurtz, and L. Li. An oracle builder's toolkit. In Proceedings of the 8th IEEE Structure in Complexity Theory Conference, pages 120-131. IEEE, New York, 1993.
6. J. Grollmann and A Selman. Complexity measures for public-key cryptosystems. SIAM Journal on Computing, 17:309-355, 1988.
7. H. Heller. On relativized exponential and probabilistic complexity classes. Information and Computation, 71:231-243, 1986.
8. R. Impagliazzo and M. Naor. Decision trees and downward closures. In Proceedings of the 3rd IEEE Structure in Complexity Theory Conference, pages 29-38. IEEE, New York, 1988.
9. C. Lautemann. BPP and the polynomial hierarchy. Information Processing Letters, 17(4):215-217, 1983.
10. N. Nisan. CREW PRAMSs and decision trees. SIAM Journal on Computing, 20(6):999-1007, December 1991.
11. M. Sipser. A complexity theoretic approach to randomness. In Proceedings of the 15th ACM Symposium on the Theory of Computing, pages 330-335. ACM, New York, 1983.
12. S. Zachos. Probabilistic quantifiers and games. Journal of Computer and System Sciences, 36:433-451, 1988.