Linearity Testing/Testing Hadamard Codes

[1]  Simon Litsyn,et al.  Breaking the Epsilon-Soundness Bound of the Linearity Test over GF(2) , 2008, SIAM J. Comput..

[2]  Ronitt Rubinfeld,et al.  Non‐Abelian homomorphism testing, and distributions close to their self‐convolutions , 2008, Random Struct. Algorithms.

[3]  Simon Litsyn,et al.  Almost orthogonal linear codes are locally testable , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[4]  Luca Trevisan,et al.  Gowers uniformity, influence of variables, and PCPs , 2005, STOC '06.

[5]  Dana Ron,et al.  Testing polynomials over general fields , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[6]  Atri Rudra,et al.  Testing low-degree polynomials over prime fields , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[7]  Avi Wigderson,et al.  Derandomizing homomorphism testing in general groups , 2004, STOC '04.

[8]  Noga Alon,et al.  Testing Low-Degree Polynomials over GF(2( , 2003, RANDOM-APPROX.

[9]  Eli Ben-Sasson,et al.  Randomness-efficient low degree tests and short PCPs via epsilon-biased sets , 2003, STOC '03.

[10]  Frédéric Magniez,et al.  Approximate testing with error relative to input size , 2003, J. Comput. Syst. Sci..

[11]  Ronitt Rubinfeld,et al.  Checking Approximate Computations of Polynomials and Functional Equations , 2002, SIAM J. Comput..

[12]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[13]  Avi Wigderson,et al.  Simple analysis of graph tests for linearity and PCP , 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.

[14]  Frédéric Magniez,et al.  Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey , 2000, Theoretical Aspects of Computer Science.

[15]  Luca Trevisan,et al.  A PCP characterization of NP with optimal amortized query complexity , 2000, STOC '00.

[16]  Frédéric Magniez,et al.  Multi-Linearity Self-Testing with Relative Error , 2000, Theory of Computing Systems.

[17]  Yonatan Aumann,et al.  Linear Consistency Testing , 1999, RANDOM-APPROX.

[18]  Luca Trevisan,et al.  Recycling queries in PCPs and in linearity tests (extended abstract) , 1998, STOC '98.

[19]  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.

[20]  Madhu Sudan,et al.  Improved Low-Degree Testing and its Applications , 1997, STOC '97.

[21]  Dana Ron,et al.  Property testing and its connection to learning and approximation , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[22]  Ronitt Rubinfeld,et al.  Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..

[23]  Mihir Bellare,et al.  Linearity testing in characteristic two , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[24]  Mihir Bellare,et al.  Free bits, PCPs and non-approximability-towards tight results , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[25]  Ronitt Rubinfeld,et al.  On the robustness of functional equations , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[26]  Daniel A. Spielman,et al.  Nearly-linear size holographic proofs , 1994, STOC '94.

[27]  Manuel Blum,et al.  Checking approximate computations over the reals , 1993, STOC.

[28]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[29]  Ronitt Rubinfeld,et al.  Self-testing/correcting for polynomials and for approximate functions , 1991, STOC '91.

[30]  Manuel Blum,et al.  Self-testing/correcting with applications to numerical problems , 1990, STOC '90.

[31]  Dana Ron,et al.  Testing Basic Boolean Formulae , 2002, SIAM J. Discret. Math..