Easiness Assumptions and Hardness Tests: Trading Time for Zero Error

Journal of Computer and System Sciences

Volumn 63, Issue 2, 2001, Pages 236-252

  Kabanets, Valentine ^a  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000152441     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.2001.1763     Document Type: Article

References (20)

1. Babai L., Fortnow L., Nisan N., Wigderson A. BPP has subexponential time simulations unless EXPTIME has publishable proofs. Complexity. 3:1993;307-318.
2. Boppana R., Hirschfeld R. Pseudo-random generators and complexity classes. Micali S. Advances in Computer Research. 1989;1-26 JAI Press, New York.
3. Buhrman H., Fortnow L. One-sided versus two-sided error in probabilistic computation. Meinel C., Tison S. Proceedings of the Sixteenth Annual Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science. 1563:1999;100-109 Springer-Verlag, Berlin/New York.
4. Goldreich O., Krawczyk H., Luby M. On the existence of pseudo-random generators. Proceedings of the Twenty-Ninth Annual IEEE Symposium on Foundations of Computer Science. 1988;. p. 12-24.
5. Goldreich O., Levin L. A. A hard-core predicate for all one-way functions. Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing. 1989;. p. 25-32.
6. Håstad J., Impagliazzo R., Levin L., Luby M. A pseudorandom generator from any one-way function. SIAM J. Comput. 28:1999;1364-1396.
7. Heller H. On relativized polynomial and exponential computations. SIAM J. Comp. 13:1984;717-725.
8. Heller H. Relativized polynomial hierarchies extending two levels. Math. Systems Theory. 17:1984;71-84.
9. Hopcroft J. E., Ullman J. D. Introduction to Automata Theory, Languages, and Computation. 1979;Addison-Wesley, Reading.
10. Impagliazzo R., Wigderson A. P=BPP if E requires exponential circuits: Derandomizing the XOR Lemma. Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing. 1997;. p. 220-229.
11. Impagliazzo R., Wigderson A. Randomness vs. time: De-randomization under a uniform assumption. Proceedings of the Thirty-Ninth Annual IEEE Symposium on Foundations of Computer Science. 1998;. p. 734-743.
12. Kabanets V., Cai J.-Y. Circuit minimization problem. Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing. 2000;. p. 73-79.
13. Klivans A., van Melkebeek D. Graph nonisomorphism has subexponential size proofs unless the polynomial hierarchy collapses. Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing. 1999;. p. 659-667.
14. Levin L. A. One-way functions and pseudorandom generators. Combinatorica. 7:1987;357-363.
15. Lu C.-J. Derandomizing Arthur-Merlin games under uniform assumptions. Proceedings of the Eleventh Annual International Symposium on Algorithms and Computation (ISAAC'00). 2000.
16. Motwani R., Raghavan P. Randomized Algorithms. 1995;Cambridge University Press, New York.
17. Muchnik A. A., Vereshchagin N. K. A general method to construct oracles realizing given relationships between complexity classes. Theoret. Comput. Sci. 157:1996;227-258.
18. Nisan N., Wigderson A. Hardness vs. randomness. J. Comput. System Sci. 49:1994;149-167.
19. Razborov A. A., Rudich S. Natural proofs. J. Comput. System Sci. 55:1997;24-35.
20. Yao A. C. Theory and applications of trapdoor functions. Proceedings of the Twenty-Third Annual IEEE Symposium on Foundations of Computer Science. 1982;. p. 80-91.