Hardness amplification within NP against deterministic algorithms
暂无分享,去创建一个
[1] Luca Trevisan,et al. On uniform amplification of hardness in NP , 2005, STOC '05.
[2] Lance Fortnow,et al. BPP has subexponential time simulations unlessEXPTIME has publishable proofs , 2005, computational complexity.
[3] Venkatesan Guruswami,et al. List decoding algorithms for certain concatenated codes , 2000, STOC '00.
[4] Andrew Chi-Chih Yao,et al. Theory and Applications of Trapdoor Functions (Extended Abstract) , 1982, FOCS.
[5] Luca Trevisan,et al. Pseudorandom generators without the XOR Lemma , 1999, Electron. Colloquium Comput. Complex..
[6] Noga Alon,et al. Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs , 1992, IEEE Trans. Inf. Theory.
[7] Russell Impagliazzo,et al. Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification , 2006, FOCS.
[8] Luca Trevisan,et al. List-decoding using the XOR lemma , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[9] Avi Wigderson,et al. P = BPP if E requires exponential circuits: derandomizing the XOR lemma , 1997, STOC '97.
[10] Luca Trevisan,et al. Pseudorandomness and average-case complexity via uniform reductions , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[11] Noam Nisan,et al. On Yao's XOR-Lemma , 1995, Electron. Colloquium Comput. Complex..
[12] Russell Impagliazzo,et al. Hard-core distributions for somewhat hard problems , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[13] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.
[14] Rahul Santhanam,et al. Uniform Hardness Amplification in NP via Monotone Codes , 2006, Electron. Colloquium Comput. Complex..
[15] A. Akavia,et al. Perturbation codes , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.
[16] Venkatesan Guruswami,et al. Linear-time encodable/decodable codes with near-optimal rate , 2005, IEEE Transactions on Information Theory.
[17] Emanuele Viola,et al. The complexity of constructing pseudorandom generators from hard functions , 2005, computational complexity.
[18] Avi Wigderson,et al. Uniform direct product theorems: simplified, optimized, and derandomized , 2008, SIAM J. Comput..
[19] N. Linial,et al. Expander Graphs and their Applications , 2006 .
[20] Venkatesan Guruswami,et al. Expander-based constructions of efficiently decodable codes , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[21] Emanuele Viola,et al. On constructing parallel pseudorandom generators from one-way functions , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).
[22] Venkatesan Guruswami,et al. Hardness Amplification via Space-Efficient Direct Products , 2006, computational complexity.
[23] Emanuele Viola,et al. Using Nondeterminism to Amplify Hardness , 2006, SIAM J. Comput..
[24] G. David Forney,et al. Generalized minimum distance decoding , 1966, IEEE Trans. Inf. Theory.
[25] Andrew Chi-Chih Yao,et al. Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[26] Luca Trevisan,et al. On Worst-Case to Average-Case Reductions for NP Problems , 2005, Electron. Colloquium Comput. Complex..
[27] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[28] Avi Wigderson,et al. On Pseudorandomness with respect to Deterministic Observes , 2000, ICALP Satellite Workshops.
[29] 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).
[30] Ryan O'Donnell,et al. Hardness amplification within NP , 2002, STOC '02.
[31] Shafi Goldwasser,et al. Learning noisy characters, multiplication codes, and cryptographic hardcore predicates , 2008 .