Robust locally testable codes and products of codes
暂无分享,去创建一个
[1] Omer Reingold,et al. Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem , 2004, FOCS.
[2] Ronitt Rubinfeld,et al. Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..
[3] László Lovász,et al. Interactive proofs and the hardness of approximating cliques , 1996, JACM.
[4] Madhu Sudan,et al. Some improvements to total degree tests , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.
[5] Robert Michael Tanner,et al. A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.
[6] Paul Valiant,et al. The Tensor Product of Two Codes Is Not Necessarily Robustly Testable , 2005, APPROX-RANDOM.
[7] Sanjeev Arora,et al. Probabilistic checking of proofs; a new characterization of NP , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[8] Mihir Bellare,et al. Linearity testing in characteristic two , 1996, IEEE Trans. Inf. Theory.
[9] Manuel Blum,et al. Self-testing/correcting with applications to numerical problems , 1990, STOC '90.
[10] Mihir Bellare,et al. Improved non-approximability results , 1994, STOC '94.
[11] Oded Goldreich,et al. A Combinatorial Consistency Lemma with application to the PCP Theorem , 1996, Electron. Colloquium Comput. Complex..
[12] Eli Ben-Sasson,et al. Robust pcps of proximity, shorter pcps and applications to coding , 2004, STOC '04.
[13] László Babai,et al. Local Expansion of Ssymmetrical Graphs , 1992, Comb. Probab. Comput..
[14] Noga Alon,et al. Testing Reed-Muller codes , 2005, IEEE Transactions on Information Theory.
[15] Eli Ben-Sasson,et al. Robust locally testable codes and products of codes , 2004, Random Struct. Algorithms.
[16] Sanjeev Arora. Probabilistic checking of proofs and hardness of approximation problems , 1995 .
[17] Leonid A. Levin,et al. Checking computations in polylogarithmic time , 1991, STOC '91.
[18] László Lovász,et al. Random Walks on Graphs: A Survey , 1993 .
[19] Madhu Sudan,et al. Improved Low-Degree Testing and its Applications , 1997, STOC '97.
[20] Daniel A. Spielman,et al. Nearly-linear size holographic proofs , 1994, STOC '94.
[21] Carsten Lund,et al. Efficient probabilistically checkable proofs and applications to approximations , 1993, STOC.
[22] Carsten Lund,et al. Proof verification and the hardness of approximation problems , 1998, JACM.
[23] Alexander Shen,et al. Low-degree tests , 1994, SODA '94.
[24] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .
[25] SudanMadhu,et al. Proof verification and the hardness of approximation problems , 1998 .
[26] 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..
[27] 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.
[28] Eli Ben-Sasson,et al. Randomness-efficient low degree tests and short PCPs via epsilon-biased sets , 2003, STOC '03.
[29] Carsten Lund,et al. Non-deterministic exponential time has two-prover interactive protocols , 1992, computational complexity.
[30] Eli Ben-Sasson,et al. Some 3CNF properties are hard to test , 2003, STOC '03.
[31] Carsten Lund,et al. Non-deterministic exponential time has two-prover interactive protocols , 2005, computational complexity.
[32] L. Asz. Random Walks on Graphs: a Survey , 2022 .