Easiness assumptions and hardness tests: trading time for zero error
暂无分享,去创建一个
[1] Rafael Hirschfeld,et al. Pseudorandom Generators and Complexity Classes , 1989, Advances in Computational Research.
[2] Lance Fortnow,et al. One-sided Versus Two-sided Error in Probabilistic Computation , 1999, STACS.
[3] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[4] Chi-Jen Lu. Derandomizing Arthur—Merlin games under uniform assumptions , 2001, computational complexity.
[5] Jin-Yi Cai,et al. Circuit minimization problem , 2000, STOC '00.
[6] Hans Heller. On Relativized Polynomial and Exponential Computations , 1984, SIAM J. Comput..
[7] Leonid A. Levin,et al. A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..
[8] Leonid A. Levin,et al. A hard-core predicate for all one-way functions , 1989, STOC '89.
[9] Noam Nisan,et al. BPP has subexponential time simulations unless EXPTIME has publishable proofs , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.
[10] Rajeev Motwani,et al. Randomized Algorithms , 1995, SIGA.
[11] Avi Wigderson,et al. Randomness vs. time: de-randomization under a uniform assumption , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[12] Hugo Krawczyk,et al. On the Existence of Pseudorandom Generators , 1988, CRYPTO.
[13] Alexander A. Razborov,et al. Natural Proofs , 2007 .
[14] Andrew Chi-Chih Yao,et al. Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[15] Noam Nisan,et al. Hardness vs. randomness , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[16] A. King. Verbal Interaction and Problem-Solving within Computer-Assisted Cooperative Learning Groups , 1989 .
[17] Nikolai K. Vereshchagin,et al. A General Method to Construct Oracles Realizing Given Relationships Between Complexity Classes , 1996, Theor. Comput. Sci..
[18] Avi Wigderson,et al. P = BPP if E requires exponential circuits: derandomizing the XOR lemma , 1997, STOC '97.
[19] Chi-Jen Lu,et al. Derandomizing Arthur-Merlin Games under Uniform Assumptions , 2000, ISAAC.
[20] Hugo Krawczyk,et al. On the existence of pseudorandom generators , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[21] Leonid A. Levin,et al. One-way functions and pseudorandom generators , 1985, STOC '85.