暂无分享,去创建一个
[1] Madhu Sudan,et al. Succinct Representation of Codes with Applications to Testing , 2009, SIAM J. Discret. Math..
[2] Zeev Dvir,et al. An Improved Analysis of Linear Mergers , 2007, computational complexity.
[3] Testing low-degree polynomials over prime fields , 2009 .
[4] K.J.C. Smith. On the p-rank of the incidence matrix of points and hyperplanes in a finite projective geometry , 1969 .
[5] Shubhangi Saraf,et al. High-rate codes with sublinear-time decoding , 2011, STOC '11.
[6] Sanjeev Arora,et al. Computational Complexity: A Modern Approach , 2009 .
[7] Eli Ben-Sasson,et al. On Sums of Locally Testable Affine Invariant Properties , 2011, APPROX-RANDOM.
[8] Zeev Dvir,et al. On the size of Kakeya sets in finite fields , 2008, 0803.2336.
[9] Ronitt Rubinfeld,et al. Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..
[10] Avi Wigderson,et al. Symmetric LDPC codes and local testing , 2016, Comb..
[11] Liangpan Li,et al. On the size of Nikodym sets in finite fields , 2008, 0803.3525.
[12] Jian Shen,et al. Some Inequalities in Functional Analysis, Combinatorics, and Probability Theory , 2010, Electron. J. Comb..
[13] Madhu Sudan,et al. Some improvements to total degree tests , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.
[14] Madhu Sudan,et al. Absolutely Sound Testing of Lifted Codes , 2013, APPROX-RANDOM.
[15] Shubhangi Saraf,et al. High-rate codes with sublinear-time decoding , 2014, Electron. Colloquium Comput. Complex..
[16] Madhu Sudan,et al. Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[17] Eli Ben-Sasson,et al. Sparse affine-invariant linear codes are locally testable , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[18] Ronitt Rubinfeld,et al. Self-testing/correcting for polynomials and for approximate functions , 1991, STOC '91.
[19] Eli Ben-Sasson,et al. Limits on the Rate of Locally Testable Affine-Invariant Codes , 2011, APPROX-RANDOM.
[20] Prasad Raghavendra,et al. Making the long code shorter, with applications to the Unique Games Conjecture , 2011, Electron. Colloquium Comput. Complex..
[21] Madhu Sudan,et al. Improved Low-Degree Testing and its Applications , 1997, STOC '97.
[22] Carsten Lund,et al. Proof verification and the hardness of approximation problems , 1998, JACM.
[23] Eli Ben-Sasson,et al. Symmetric LDPC Codes are not Necessarily Locally Testable , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.
[24] Madhu Sudan,et al. Algebraic property testing: the role of invariance , 2008, Electron. Colloquium Comput. Complex..
[25] Madhu Sudan,et al. Optimal Testing of Reed-Muller Codes , 2010, FOCS.
[26] Atri Rudra,et al. Testing low-degree polynomials over prime fields , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[27] Tali Kaufman,et al. Edge transitive ramanujan graphs and symmetric LDPC good codes , 2012, STOC '12.
[28] Shachar Lovett,et al. Testing of exponentially large codes, by a new extension to Weil bound for character sums , 2010, Electron. Colloquium Comput. Complex..
[29] Madhu Sudan,et al. Highly Resilient Correctors for Polynomials , 1992, Inf. Process. Lett..
[30] Madhu Sudan,et al. Optimal Testing of Reed-Muller Codes , 2009, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[31] Noga Alon,et al. Testing Reed-Muller codes , 2005, IEEE Transactions on Information Theory.
[32] Dana Ron,et al. Testing polynomials over general fields , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[33] Madhu Sudan,et al. Optimal Testing of Multivariate Polynomials over Small Prime Fields , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[34] Madhu Sudan,et al. 2-Transitivity Is Insufficient for Local Testability , 2008, Computational Complexity Conference.
[35] Madhu Sudan,et al. Improved lower bound on the size of Kakeya sets over finite fields , 2008, 0808.2499.
[36] Madhu Sudan,et al. Some closure features of locally testable affine-invariant properties , 2012, Electron. Colloquium Comput. Complex..
[37] Oded Goldreich,et al. Proximity Oblivious Testing and the Role of Invariances , 2011, APPROX-RANDOM.
[38] James W. P. Hirschfeld,et al. The dimension of projective geometry codes , 1992, Discret. Math..
[39] 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.
[40] Avi Wigderson,et al. Kakeya Sets, New Mergers and Old Extractors , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.