Robust Characterizations of Polynomials with Applications to Program Testing

The study of self-testing and self-correcting programs leads to the search for robust characterizations of functions. Here the authors make this notion precise and show such a characterization for polynomials. From this characterization, the authors get the following applications. Simple and efficient self-testers for polynomial functions are constructed. The characterizations provide results in the area of coding theory by giving extremely fast and efficient error-detecting schemes for some well-known codes. This error-detection scheme plays a crucial role in subsequent results on the hardness of approximating some NP-optimization problems.

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

[2]  László Lovász,et al.  Two-prover one-round proof systems: their power and their problems (extended abstract) , 1992, STOC '92.

[3]  Carsten Lund,et al.  Proof verification and the intractability of approximation problems , 1992, FOCS 1992.

[4]  Joan Feigenbaum,et al.  Hiding Instances in Multioracle Queries , 1990, STACS.

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

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

[7]  Alexander Shen,et al.  Low-degree tests , 1994, SODA '94.

[8]  László Lovász,et al.  Approximating clique is almost NP-complete , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[9]  Adi Shamir,et al.  Fully parallelized multi prover protocols for NEXP-time , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[10]  Richard J. Lipton,et al.  New Directions In Testing , 1989, Distributed Computing And Cryptography.

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

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

[13]  Sanjeev Arora,et al.  Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.

[14]  László Babai,et al.  Transparent (Holographic) Proofs , 1993, STACS.

[15]  R. Rubinfeld.  A mathematical theory of self-checking, self-testing and self-correcting programs , 1991 .

[16]  Leonid A. Levin,et al.  Checking computations in polylogarithmic time , 1991, STOC '91.

[17]  Carsten Lund.  Power of interaction , 1992, ACM Distinguished dissertations.

[18]  V. Rich.  Personal communication , 1989, Nature.