Locally Testable Codes Require Redundant Testers
暂无分享,去创建一个
[1] Sanjeev Arora,et al. Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.
[2] Eric Vigoda,et al. Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting , 2007, FOCS.
[3] Robust locally testable codes and products of codes , 2006 .
[4] Noga Alon,et al. Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs , 1992, IEEE Trans. Inf. Theory.
[5] Eli Ben-Sasson,et al. Sound 3-Query PCPPs Are Long , 2008, TOCT.
[6] Carsten Lund,et al. Proof verification and the hardness of approximation problems , 1998, JACM.
[7] Eli Ben-Sasson,et al. Low Rate Is Insufficient for Local Testability , 2010, APPROX-RANDOM.
[8] Eli Ben-Sasson,et al. Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding , 2004, SIAM J. Comput..
[9] Madhu Sudan,et al. Sparse Random Linear Codes are Locally Decodable and Testable , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[10] Oded Goldreich,et al. Locally testable codes and PCPs of almost-linear length , 2006, JACM.
[11] Mihir Bellare,et al. Free Bits, PCPs, and Nonapproximability-Towards Tight Results , 1998, SIAM J. Comput..
[12] Venkatesan Guruswami. On 2-Query Codeword Testing with Near-Perfect Completeness , 2006, ISAAC.
[13] Eli Ben-Sasson,et al. Simple PCPs with poly-log rate and query complexity , 2005, STOC '05.
[14] László Babai,et al. Locally testable cyclic codes , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[15] Eli Ben-Sasson,et al. Some 3CNF Properties Are Hard to Test , 2005, SIAM J. Comput..
[16] Or Meir,et al. Combinatorial construction of locally testable codes , 2008, SIAM J. Comput..
[17] Daniel A. Spielman. Linear-time encodable and decodable error-correcting codes , 1996, IEEE Trans. Inf. Theory.
[18] Oded Goldreich,et al. Short Locally Testable Codes and Proofs (Survey) , 2005, Electron. Colloquium Comput. Complex..
[19] Madhu Sudan,et al. 2-Transitivity Is Insufficient for Local Testability , 2008, Computational Complexity Conference.
[20] Madhu Sudan,et al. Algebraic property testing: the role of invariance , 2008, Electron. Colloquium Comput. Complex..
[21] Paul Valiant,et al. The Tensor Product of Two Codes Is Not Necessarily Robustly Testable , 2005, APPROX-RANDOM.
[22] Avi Wigderson,et al. Robust local testability of tensor products of LDPC codes ? , 2006 .
[23] Ron M. Roth,et al. Introduction to Coding Theory , 2019, Discrete Mathematics.
[24] Omer Reingold,et al. Assignment testers: towards a combinatorial proof of the PCP-theorem , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[25] Eli Ben-Sasson,et al. Bounds on 2-Query Codeword Testing , 2003, RANDOM-APPROX.
[26] Ivan Damgård,et al. Automata, Languages and Programming , 2008, Lecture Notes in Computer Science.