Characterizations of Locally Testable Linear- and Affine-Invariant Families
暂无分享,去创建一个
[1] Ran Raz,et al. Sub-constant error low degree test of almost-linear size , 2006, STOC '06.
[2] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .
[3] Madhu Sudan,et al. Improved Low-Degree Testing and its Applications , 2003, Comb..
[4] Tadao Kasami,et al. New generalizations of the Reed-Muller codes-I: Primitive codes , 1968, IEEE Trans. Inf. Theory.
[5] Oded Goldreich,et al. Locally testable codes and PCPs of almost-linear length , 2006, JACM.
[6] Ronitt Rubinfeld. On the Robustness of Functional Equations , 1999, SIAM J. Comput..
[7] Eli Ben-Sasson,et al. Randomness-efficient low degree tests and short PCPs via epsilon-biased sets , 2003, STOC '03.
[8] Noga Alon,et al. A combinatorial characterization of the testable graph properties: it's all about regularity , 2006, STOC '06.
[9] Noga Alon,et al. Testing Low-Degree Polynomials over GF(2( , 2003, RANDOM-APPROX.
[10] Madhu Sudan,et al. 2-Transitivity Is Insufficient for Local Testability , 2008, Computational Complexity Conference.
[11] Mihir Bellare,et al. Linearity testing in characteristic two , 1996, IEEE Trans. Inf. Theory.
[12] Eli Ben-Sasson,et al. Robust pcps of proximity, shorter pcps and applications to coding , 2004, STOC '04.
[13] Manuel Blum,et al. Self-testing/correcting with applications to numerical problems , 1990, STOC '90.
[14] Avi Wigderson,et al. Simple analysis of graph tests for linearity and PCP , 2003, Random Struct. Algorithms.
[15] Dana Ron,et al. Testing polynomials over general fields , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[16] Atri Rudra,et al. Testing Low-Degree Polynomials over Prime Fields , 2004, FOCS.
[17] Madhu Sudan,et al. Algebraic property testing: the role of invariance , 2008, Electron. Colloquium Comput. Complex..
[18] Luca Trevisan,et al. Three Theorems regarding Testing Graph Properties , 2001, Electron. Colloquium Comput. Complex..
[19] Simon Litsyn,et al. Almost orthogonal linear codes are locally testable , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[20] Dana Ron,et al. Property testing and its connection to learning and approximation , 1998, JACM.
[21] Kenji Obata,et al. A lower bound for testing 3-colorability in bounded-degree graphs , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[22] Eli Ben-Sasson,et al. Some 3CNF Properties Are Hard to Test , 2005, SIAM J. Comput..
[23] Ronitt Rubinfeld,et al. Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..
[24] László Lovász,et al. Graph limits and parameter testing , 2006, STOC '06.
[25] Sanjeev Arora,et al. Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.