A Self-Tester for Linear Functions over the Integers with an Elementary Proof of Correctness

We present simple, self-contained proofs of correctness for algorithms for linearity testing and program checking of linear functions on finite subsets of integers represented as n-bit numbers. In addition we explore a generalization of self-testing to homomorphisms on a multidimensional vector space. We show that our self-testing algorithm for the univariate case can be directly generalized to vector space domains. The number of queries made by our algorithms is independent of domain size.

[1]  Mihir Bellare,et al.  Linearity testing in characteristic two , 1996, IEEE Trans. Inf. Theory.

[2]  Dana Ron,et al.  Property testing and its connection to learning and approximation , 1998, JACM.

[3]  Simon Litsyn,et al.  Breaking the ε-Soundness Bound of the Linearity Test over GF(2) , 2007, Electron. Colloquium Comput. Complex..

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

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

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

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

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

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

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

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

[12]  Marcos A. Kiwi,et al.  Probabilistically checkable proofs and the testing of hadamard-like codes , 1996 .

[13]  Luca Trevisan,et al.  Probabilistically checkable proofs with low amortized query complexity , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[14]  Carsten Lund,et al.  Non-deterministic exponential time has two-prover interactive protocols , 2005, computational complexity.

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

[16]  Carsten Lund,et al.  Efficient probabilistically checkable proofs and applications to approximations , 1993, STOC.

[17]  Manuel Blum,et al.  Designing programs that check their work , 1989, STOC '89.

[18]  Simon Litsyn,et al.  Breaking the epsilon-Soundness Bound of the Linearity Test over GF(2) , 2008, APPROX-RANDOM.

[19]  Martin Fürer.  Faster integer multiplication , 2007, STOC '07.

[20]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[21]  Ronitt Rubinfeld,et al.  Self-testing polynomial functions efficiently and over rational domains , 1992, SODA '92.

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