2-Transitivity Is Insufficient for Local Testability
暂无分享,去创建一个
[1] Ronitt Rubinfeld,et al. Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..
[2] Carsten Lund,et al. Non-deterministic exponential time has two-prover interactive protocols , 1992, computational complexity.
[3] Noga Alon,et al. Testing Reed-Muller codes , 2005, IEEE Transactions on Information Theory.
[4] Dana Ron,et al. Property testing and its connection to learning and approximation , 1998, JACM.
[5] Leonid A. Levin,et al. Checking computations in polylogarithmic time , 1991, STOC '91.
[6] Noga Alon,et al. Testing Low-Degree Polynomials over GF(2( , 2003, RANDOM-APPROX.
[7] László Lovász,et al. Interactive proofs and the hardness of approximating cliques , 1996, JACM.
[8] Madhu Sudan,et al. Succinct Representation of Codes with Applications to Testing , 2009, SIAM J. Discret. Math..
[9] Carsten Lund,et al. Proof verification and the hardness of approximation problems , 1998, JACM.
[10] Eli Ben-Sasson,et al. Some 3CNF Properties Are Hard to Test , 2005, SIAM J. Comput..
[11] 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).
[12] Madhu Sudan,et al. Algebraic property testing: the role of invariance , 2008, Electron. Colloquium Comput. Complex..
[13] Dana Ron,et al. Testing Polynomials over General Fields , 2006, SIAM J. Comput..
[14] Noga Alon,et al. A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity , 2009 .
[15] Manuel Blum,et al. Self-testing/correcting with applications to numerical problems , 1990, STOC '90.
[16] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .
[17] László Lovász,et al. Graph limits and parameter testing , 2006, STOC '06.
[18] Sanjeev Arora,et al. Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.