Sparse Affine-Invariant Linear Codes Are Locally Testable
暂无分享,去创建一个
[1] László Lovász,et al. Graph limits and parameter testing , 2006, STOC '06.
[2] Eli Ben-Sasson,et al. On Sums of Locally Testable Affine Invariant Properties , 2011, APPROX-RANDOM.
[3] Asaf Shapira. Green's conjecture and testing linear-invariant properties , 2009, STOC '09.
[4] Noga Alon,et al. A combinatorial characterization of the testable graph properties: it's all about regularity , 2006, STOC '06.
[5] Eli Ben-Sasson,et al. Some 3CNF Properties Are Hard to Test , 2005, SIAM J. Comput..
[6] Shachar Lovett,et al. New Extension of the Weil Bound for Character Sums with Applications to Coding , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[7] Jean Bourgain,et al. Estimates for the Number of Sums and Products and for Exponential Sums in Fields of Prime Order , 2006 .
[8] Venkatesan Guruswami,et al. Locally Testable Codes Require Redundant Testers , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.
[9] Eli Ben-Sasson,et al. Sparse affine-invariant linear codes are locally testable , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[10] Madhu Sudan,et al. Algebraic property testing: the role of invariance , 2008, STOC '08.
[11] Madhu Sudan,et al. 2-Transitivity is Insufficient for Local Testability , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.
[12] Simon Litsyn,et al. Almost orthogonal linear codes are locally testable , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[13] Avi Wigderson,et al. Extracting Randomness Using Few Independent Sources , 2006, SIAM J. Comput..
[14] 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).
[15] Waring's Number in a Finite Field , 2009 .
[16] Shachar Lovett,et al. Testing of exponentially large codes, by a new extension to Weil bound for character sums , 2010, Electron. Colloquium Comput. Complex..
[17] Madhu Sudan,et al. Testing Linear-Invariant Non-linear Properties: A Short Report , 2010, Property Testing.
[18] Eric Vigoda,et al. Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting , 2007, FOCS.
[19] Asaf Shapira,et al. A Unified Framework for Testing Linear-Invariant Properties , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[20] Richard Zippel,et al. Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.
[21] Shubhangi Saraf,et al. Local list-decoding and testing of random linear codes from high error , 2010, STOC '10.
[22] Eli Ben-Sasson,et al. Limits on the Rate of Locally Testable Affine-Invariant Codes , 2011, APPROX-RANDOM.
[23] Jacob T. Schwartz,et al. Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.
[24] Shachar Lovett,et al. Every locally characterized affine-invariant property is testable , 2013, STOC '13.
[25] Terence Tao,et al. A sum-product estimate in finite fields, and applications , 2003, math/0301343.
[26] Madhu Sudan,et al. Testing Linear-Invariant Non-Linear Properties , 2011, Theory Comput..
[27] Todd Cochrane,et al. Sum-Product Estimates Applied to Waring's Problem over Finite Fields , 2011, Integers.