Some closure features of locally testable affine-invariant properties
暂无分享,去创建一个
[1] Madhu Sudan,et al. Property Testing via Set-Theoretic Operations , 2011, ICS.
[2] Eli Ben-Sasson,et al. On Sums of Locally Testable Affine Invariant Properties , 2011, APPROX-RANDOM.
[3] Madhu Sudan. Invariance in Property Testing , 2010, Electron. Colloquium Comput. Complex..
[4] Atri Rudra,et al. Testing low-degree polynomials over prime fields , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[5] Dana Ron,et al. Property testing and its connection to learning and approximation , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[6] Madhu Sudan,et al. Succinct Representation of Codes with Applications to Testing , 2009, SIAM J. Discret. Math..
[7] Eli Ben-Sasson,et al. Some 3CNF properties are hard to test , 2003, STOC '03.
[8] Eli Ben-Sasson,et al. Limits on the Rate of Locally Testable Affine-Invariant Codes , 2011, APPROX-RANDOM.
[9] Madhu Sudan,et al. Optimal Testing of Reed-Muller Codes , 2009, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[10] Noga Alon,et al. Testing Reed-Muller codes , 2005, IEEE Transactions on Information Theory.
[11] Eli Ben-Sasson,et al. Sparse Affine-Invariant Linear Codes Are Locally Testable , 2012, FOCS.
[12] Eli Ben-Sasson,et al. Symmetric LDPC Codes are not Necessarily Locally Testable , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.
[13] Madhu Sudan,et al. Algebraic property testing: the role of invariance , 2008, STOC '08.
[14] Dana Ron,et al. Testing Polynomials over General Fields , 2006, SIAM J. Comput..
[15] Madhu Sudan,et al. Optimal Testing of Multivariate Polynomials over Small Prime Fields , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[16] Alan Guo,et al. New affine-invariant codes from lifting , 2012, ITCS '13.
[17] Madhu Sudan,et al. 2-Transitivity Is Insufficient for Local Testability , 2008, Computational Complexity Conference.