Limitations of Hardness vs. Randomness under Uniform Reductions
暂无分享,去创建一个
[1] Luca Trevisan,et al. Pseudorandomness and average-case complexity via uniform reductions , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[2] Avi Wigderson,et al. Randomness vs Time: Derandomization under a Uniform Assumption , 2001, J. Comput. Syst. Sci..
[3] Andrew Chi-Chih Yao,et al. Theory and Applications of Trapdoor Functions (Extended Abstract) , 1982, FOCS.
[4] Guy N. Rothblum,et al. The Complexity of Local List Decoding , 2008, APPROX-RANDOM.
[5] Manuel Blum,et al. How to generate cryptographically strong sequences of pseudo random bits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[6] Luca Trevisan,et al. On Worst-Case to Average-Case Reductions for NP Problems , 2005, Electron. Colloquium Comput. Complex..
[7] Andrew Chi-Chih Yao,et al. Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[8] Valentine Kabanets. Easiness Assumptions and Hardness Tests: Trading Time for Zero Error , 2001, J. Comput. Syst. Sci..
[9] Christopher Umans,et al. Low-end uniform hardness vs. randomness tradeoffs for AM , 2007, STOC '07.
[10] Christopher Umans. Pseudo-random generators for all hardnesses , 2002, STOC '02.
[11] Michael Sipser,et al. A complexity theoretic approach to randomness , 1983, STOC.
[12] Valentine Kabanets,et al. Easiness assumptions and hardness tests: trading time for zero error , 2000, Proceedings 15th Annual IEEE Conference on Computational Complexity.
[13] Russell Impagliazzo,et al. Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds , 2003, STOC '03.
[14] Luca Trevisan,et al. Extractors and pseudorandom generators , 2001, JACM.
[15] Avi Wigderson,et al. In search of an easy witness: exponential time vs. probabilistic polynomial time , 2002, J. Comput. Syst. Sci..
[16] Luca Trevisan,et al. Construction of extractors using pseudo-random generators (extended abstract) , 1999, STOC '99.
[17] Richard J. Lipton,et al. Some connections between nonuniform and uniform complexity classes , 1980, STOC '80.
[18] Noam Nisan,et al. Hardness vs. randomness , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[19] Leslie G. Valiant,et al. Random Generation of Combinatorial Structures from a Uniform Distribution , 1986, Theor. Comput. Sci..
[20] 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).
[21] Amnon Ta-Shma,et al. Uniform hardness versus randomness tradeoffs for Arthur-Merlin games , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..
[22] Amnon Ta-Shma,et al. Uniform hardness versus randomness tradeoffs for Arthur-Merlin games , 2003, computational complexity.
[23] Dieter van Melkebeek,et al. Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses , 1999, STOC '99.
[24] Luca Trevisan,et al. Notions of Reducibility between Cryptographic Primitives , 2004, TCC.
[25] 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.
[26] Avi Wigderson,et al. In search of an easy witness: exponential time vs. probabilistic polynomial time , 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.
[27] Amnon Ta-Shma,et al. If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).
[28] Larry J. Stockmeyer,et al. On Approximation Algorithms for #P , 1985, SIAM J. Comput..
[29] Lance Fortnow,et al. BPP has subexponential time simulations unlessEXPTIME has publishable proofs , 2005, computational complexity.
[30] Amnon Ta-Shma,et al. Worst-Case to Average-Case Reductions Revisited , 2007, APPROX-RANDOM.
[31] Christopher Umans,et al. Simple extractors for all min-entropies and a new pseudorandom generator , 2005, JACM.
[32] Carsten Lund,et al. Nondeterministic exponential time has two-prover interactive protocols , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[33] Emanuele Viola,et al. Hardness amplification proofs require majority , 2008, SIAM J. Comput..
[34] Rahul Santhanam. Circuit lower bounds for Merlin-Arthur classes , 2007, STOC '07.
[35] Richard J. Lipton,et al. New Directions In Testing , 1989, Distributed Computing And Cryptography.