Locally testable codes and PCPs of almost-linear length
暂无分享,去创建一个
[1] Dana Ron,et al. Property testing and its connection to learning and approximation , 1998, JACM.
[2] Eli Ben-Sasson,et al. Randomness-efficient low degree tests and short PCPs via epsilon-biased sets , 2003, STOC '03.
[3] Irit Dinur,et al. The PCP theorem by gap amplification , 2006, STOC.
[4] Mihir Bellare,et al. Free Bits, PCPs, and Nonapproximability-Towards Tight Results , 1998, SIAM J. Comput..
[5] Oded Goldreich,et al. Locally testable codes and PCPs of almost-linear length , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[6] Yacov Yacobi,et al. The Complexity of Promise Problems with Applications to Public-Key Cryptography , 1984, Inf. Control..
[7] Noga Alon,et al. Testing Low-Degree Polynomials over GF(2( , 2003, RANDOM-APPROX.
[8] Carsten Lund,et al. Non-deterministic exponential time has two-prover interactive protocols , 2005, computational complexity.
[9] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[10] Jonathan Katz,et al. On the efficiency of local decoding procedures for error-correcting codes , 2000, STOC '00.
[11] László Lovász,et al. Interactive proofs and the hardness of approximating cliques , 1996, JACM.
[12] Madhu Sudan,et al. Some improvements to total degree tests , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.
[13] Rajeev Motwani,et al. Randomized algorithms , 1996, CSUR.
[14] Luca Trevisan,et al. Lower bounds for linear locally decodable codes and private information retrieval , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[15] Ran Raz,et al. A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.
[16] Omer Reingold,et al. Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem , 2004, FOCS.
[17] Carsten Lund,et al. Efficient probabilistically checkable proofs and applications to approximations , 1993, STOC.
[18] Carsten Lund,et al. Proof verification and the hardness of approximation problems , 1998, JACM.
[19] Eli Ben-Sasson,et al. Simple PCPs with poly-log rate and query complexity , 2005, STOC '05.
[20] Russ Bubley,et al. Randomized algorithms , 1995, CSUR.
[21] Omer Reingold,et al. Assignment testers: towards a combinatorial proof of the PCP-theorem , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[22] Mihir Bellare,et al. Linearity testing in characteristic two , 1996, IEEE Trans. Inf. Theory.
[23] Manuel Blum,et al. Self-testing/correcting with applications to numerical problems , 1990, STOC '90.
[24] Sanjeev Arora,et al. Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.
[25] Eli Ben-Sasson,et al. Bounds on 2-Query Codeword Testing , 2003, RANDOM-APPROX.
[26] M. Bellare,et al. Efficient probabilistic checkable proofs and applications to approximation , 1994, STOC '94.
[27] Eli Ben-Sasson,et al. Robust pcps of proximity, shorter pcps and applications to coding , 2004, STOC '04.
[28] Sanjeev Khanna,et al. Complexity classifications of Boolean constraint satisfaction problems , 2001, SIAM monographs on discrete mathematics and applications.
[29] Lars Engebretsen,et al. Clique Is Hard To Approximate Within , 2000 .
[30] Marcos A. Kiwi. Algebraic testing and weight distributions of codes , 2003, Theor. Comput. Sci..
[31] Madhu Sudan,et al. Improved Low-Degree Testing and its Applications , 1997, STOC '97.
[32] Dan Suciu,et al. Journal of the ACM , 2006 .
[33] Leonid A. Levin,et al. Checking computations in polylogarithmic time , 1991, STOC '91.
[34] Madhu Sudan,et al. Small PCPs with low query complexity , 2000, computational complexity.
[35] Carsten Lund,et al. Non-deterministic exponential time has two-prover interactive protocols , 1992, computational complexity.
[36] DinurIrit. The PCP theorem by gap amplification , 2007 .
[37] J. Håstad. Clique is hard to approximate within n 1-C , 1996 .
[38] Eli Ben-Sasson,et al. Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding , 2004, SIAM J. Comput..
[39] GoldreichOded,et al. Locally testable codes and PCPs of almost-linear length , 2006 .
[40] Carsten Lund,et al. Proof verification and the intractability of approximation problems , 1992, FOCS 1992.
[41] László Lovász,et al. Approximating clique is almost NP-complete , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[42] J. Håstad. Clique is hard to approximate withinn1−ε , 1999 .
[43] Daniel A. Spielman,et al. Nearly-linear size holographic proofs , 1994, STOC '94.
[44] Marcos A. Kiwi. Testing and Weight Distributions of Dual Codes , 1997, Electron. Colloquium Comput. Complex..
[45] Ronitt Rubinfeld,et al. Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..