Linearity testing in characteristic two

IEEE Transactions on Information Theory

Volumn 42, Issue 6 PART 1, 1996, Pages 1781-1795

  Bellare, Mihir ^a,b   Coppersmith, Don ^c,d   Hâstad, Johan ^e   Kiwi, Marcos ^b,d   Sudan, Madhu ^d,e  

^a IEEE

^b UNIVERSITY OF CALIFORNIA   (United States)

^c IBM T J WATSON RESEARCH CENTER   (United States)

^d ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^e UNIVERSITY OF CHILE   (Chile)

Author keywords

Approximation; Error detection; Hadamard codes; Linearity testing; Maxsnp; Probabilistically checkable proofs; Program testing

Indexed keywords

APPROXIMATION THEORY; CODES (SYMBOLS); ERROR DETECTION; FOURIER TRANSFORMS; FUNCTIONS; PROBABILITY;

HADAMARD CODES; LINEARITY TEST; PROBABILISTICALLY CHECKABLE PROOFS;

COMPUTATIONAL COMPLEXITY;

EID: 0030289082     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.556674     Document Type: Article

References (20)

1. N. Alon and J. H. Spencer, The Probabilistic Method. New York: Wiley, 1992.
2. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and intractability of approximation problems, in Proc. 33rd IEEE Symp. on Foundations of Computer Science, 1992.
3. S. Arora and S. Safra, Probabilistic checking of proofs: A new characterization of NP, in Proc. 33rd IEEE Symp. on Foundations of Computer Science, 1992.
4. L. Babai, L. Fortnow, and C. Lund, Non-deterministic exponential time has two-prover interactive protocols, Comput. Complexity, vol. 1, pp. 3-40, 1991
5. L. Babai, L. Fortnow, L. Levin, and M. Szegedy, Checking computations in polylogarithmic time, in Proc. 23rd ACM Annu. Symp. on Theory of Computing, 1991.
6. M. Bellare, S. Goldwasser, G. Lund, and A. Russell, Efficient probabilistically checkable proofs and applications to approximation, in Proc. 25th ACM Annu. Symp. on Theory of Computing, 1993.
7. M. Bellare, O. Goldreich, and M. Sudan, Free bits and noriapproximability, in Proc. 36th IEEE Symp. on Foundations of Computer Science, 1995.
8. M. Bellare and M. Sudan, Improved nonapproximability results, in Proc. 26th ACM Annu. Symp. on Theory of Computing, 1994.
9. M. Blum; M. Luby, and R. Rubinfeld, Self-testing/correcting with applications to numerical problems, J. Comput. Syst. Sei., vol. 47, pp. 549-595, 1993.
10. D. Coppersmith, notes, Summer 1990.
11. U. Feige, S. Goldwasser, L. Lovâsz, S. Safra, and M. Szegedy, "Approximating clique is almost NP-complete, in Proc. 32nd IEEE Symp. on Foundations of Computer Science, 1991.
12. K. Friedl, Zs. Hâtsâgi, and A. Shen, Low-degree testing, in Proc. 5th ACM-S1AM Annu. Symp. on Discrete Algorithms, 1994.
13. K. Friedl and M. Sudan, Some improvements to total degree tests, in Proc. 3rd Israel IEEE Symp. on Theory and Computing Systems, 1995.
14. P. Gemmell, R. Lipton, R. Rubinfeld, M. Sudan, and A. Wigderson, Self-testing/correcting for polynomials and for approximate functions, in Proc. 23rd ACM Annu. Symp. on Theory of Computing, 1991.
15. J. Hâstad, Testing of the long code and hardness for clique, to be published in Proc. 28th ACM Annu. Symp. on Theory of Computing, 1996.
16. M. Kiwi, Probabilistically checkable proofs and the testing of Hadamard-like codes, Ph.D. dissertation, MIT, Cambridge, MA, Feb. 1996
17. D. J. Kleitman, private communication, Oct. 1995.
18. F. J. Mac Williams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
19. A. Polishchuk and D. Spielman, Nearly linear size holographic proofs, in Proc. 26th ACM Annu. Symp. on Theory of Computing, 1994.
20. R. Rubinfeld and M. Sudan, Robust characterizations of polynomials and their applications to program testing, IBM Tech. Rep. RC 19156, 1993. To be published in S1AM J. Computing.