New direct-product testers and 2-query PCPs
暂无分享,去创建一个
Avi Wigderson | Russell Impagliazzo | Valentine Kabanets | R. Impagliazzo | A. Wigderson | Valentine Kabanets
[1] Luca Trevisan,et al. List-decoding using the XOR lemma , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[2] Thomas Holenstein,et al. Parallel repetition: simplifications and the no-signaling case , 2007, STOC '07.
[3] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[4] Oleg Verbitsky,et al. Towards the parallel repetition conjecture , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.
[5] Russell Impagliazzo,et al. Hardness as randomness: a survey of universal derandomization , 2003, ArXiv.
[6] Avi Wigderson,et al. P = BPP if E requires exponential circuits: derandomizing the XOR lemma , 1997, STOC '97.
[7] Ran Raz,et al. A Counterexample to Strong Parallel Repetition , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[8] Avi Wigderson,et al. Uniform direct product theorems: simplified, optimized, and derandomized , 2008, SIAM J. Comput..
[9] Irit Dinur,et al. Locally Testing Direct Product in the Low Error Range , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[10] Irit Dinur,et al. The PCP theorem by gap amplification , 2006, STOC.
[11] Andrew Chi-Chih Yao,et al. Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[12] Russell Impagliazzo,et al. Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[13] Uriel Feige,et al. Error Reduction by Parallel Repetition—A Negative Result , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).
[14] Or Meir,et al. Derandomized Parallel Repetition of Structured PCPs , 2010, 2010 IEEE 25th Annual Conference on Computational Complexity.
[15] Omer Reingold,et al. Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem , 2004, FOCS.
[16] Ronitt Rubinfeld,et al. Spot-Checkers , 2000, J. Comput. Syst. Sci..
[17] Oded Goldreich,et al. A Combinatorial Consistency Lemma with Application to Proving the PCP Theorem , 1997, SIAM J. Comput..
[18] Noam Nisan,et al. On Yao's XOR-Lemma , 1995, Electron. Colloquium Comput. Complex..
[19] Leonid A. Levin,et al. A hard-core predicate for all one-way functions , 1989, STOC '89.
[20] Irit Dinur,et al. PCPs with small soundness error , 2008, SIGA.
[21] Ryan O'Donnell,et al. Understanding Parallel Repetition Requires Understanding Foams , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).
[22] Uriel Feige,et al. Two-Prover Protocols - Low Error at Affordable Rates , 2000, SIAM J. Comput..
[23] Sanjeev Arora,et al. Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.
[24] Leonid A. Levin,et al. One-way functions and pseudorandom generators , 1985, STOC '85.
[25] Ran Raz,et al. A parallel repetition theorem , 1995, STOC '95.
[26] Ran Raz,et al. Two Query PCP with Sub-Constant Error , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[27] Ronitt Rubinfeld,et al. Spot-checkers , 1998, STOC '98.
[28] Anup Rao,et al. Parallel repetition in projection games and a concentration bound , 2008, SIAM J. Comput..