A zero one law for RP

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2003, Pages 48-52

  Impagliazzo, Russell ^a   Moser, Philippe ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF GENEVA   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTER SIMULATION; PROBABILITY; THEOREM PROVING; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE;

CIRCUIT COMPLEXITY;

COMPUTATIONAL COMPLEXITY; TURING MACHINES;

COMPLEXITY THEORY; COMPUTER ERRORS; PROBABILISTIC CLASS; SIZE MEASUREMENTS; ZERO-ONE LAW;

EID: 0042014464     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. V. Arvind and J. Köbler. On pseudorandomness and resource-bounded measure. Proceedings 17th Conference of the Foundations of Software Technology and Theorical Computer Science, 1346:235-249, 1997.
2. J. L. Balcazar, J. Diaz, and J. Gabarro. Structural Complexity II. EATCS Monographs on Theorical Computer Science Volume 22, Springer Verlag, 1990.
3. J. L. Balcazar, J. Diaz, and J. Gabarro. Structural Complexity I. EATCS Monographs on Theorical Computer Science Volume 11, Springer Verlag, 1995.
4. R. Impagliazzo and A. Widgerson. P = BPP if E requires exponential circuits: derandomizing the XOR lemma. Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 220-229, 1997.
5. A. Klivans and D. van Melkebeek. Graph nonisomorphism has subexponential size proofs unless the polynomial hierarchy collapses. Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pages 659-667, 1999.
6. J. Lutz. Almost everywhere high nonuniform complexity. Journal of Computer and System Science, 44:220-258, 1992.
7. P. Theory of Computing Systems, 30:429-442, 1997.
8. J. Lutz. The quantitative structure of exponential time. In L. Hemaspaandra and A. Selman, editors, Complexity Theory Retrospective II, pages 225-260. Springer, 1997.
9. D. Melkebeek. The zero one law holds for BPP. Theoretical Computer Science, 244(1-2):283-288, 2000.
10. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge University Press, New York, 1995.
11. C. Papadimitriou. Computational complexity. Addisson-Wesley, 1994.