Tolerant Locally Testable Codes
暂无分享,去创建一个
[1] Eli Ben-Sasson,et al. Robust pcps of proximity, shorter pcps and applications to coding , 2004, STOC '04.
[2] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.
[3] Lance Fortnow,et al. Tolerant Versus Intolerant Testing for Boolean Properties , 2005, Computational Complexity Conference.
[4] László Babai,et al. Locally testable cyclic codes , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[5] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometric codes , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[6] D. Spielman,et al. Expander codes , 1996 .
[7] Eli Ben-Sasson,et al. Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding , 2004, SIAM J. Comput..
[8] Eli Ben-Sasson,et al. Robust locally testable codes and products of codes , 2004, Random Struct. Algorithms.
[9] Ronitt Rubinfeld,et al. Tolerant property testing and distance approximation , 2006, J. Comput. Syst. Sci..
[10] Irit Dinur,et al. The PCP theorem by gap amplification , 2006, STOC.
[11] Oded Goldreich,et al. Locally testable codes and PCPs of almost-linear length , 2006, JACM.
[12] Daniel A. Spielman,et al. Nearly-linear size holographic proofs , 1994, STOC '94.
[13] Carsten Lund,et al. Proof verification and the hardness of approximation problems , 1998, JACM.
[14] Sanjeev Arora,et al. Probabilistic checking of proofs; a new characterization of NP , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[15] Oded Goldreich,et al. Short Locally Testable Codes and Proofs (Survey) , 2005, Electron. Colloquium Comput. Complex..
[16] Dana Ron,et al. Testing Polynomials over General Fields , 2006, SIAM J. Comput..
[17] Madhu Sudan,et al. Some improvements to total degree tests , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.
[18] Eli Ben-Sasson,et al. Simple PCPs with poly-log rate and query complexity , 2005, STOC '05.