Simple Analysis of Graph Tests for Linearity and PCP

Random Structures and Algorithms

Volumn 22, Issue 2, 2003, Pages 139-160

  Håstad, Johan ^a   Wigderson, Avi ^b,c  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^c INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

Graph test; Iterated test; Linearity testing; PCP; Pseudorandomness

Indexed keywords

EID: 0242299157     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10068     Document Type: Article

References (17)

1. N. Alon and J. Spencer, The probabilistic method, 2nd edition, Wiley, New York, 2000.
2. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and hardness of approximation problems, J ACM 45(3) (1998), 501-555.
3. S. Arora and S. Safra, Probabilistic checking of proofs: A new characterization of NP, J ACM 45(1) (1998), 70-122.
4. Y. Aumann, J. Håstad, M. Rabin, and M. Sudan, Linear consistency testing, J Comput Syst Sci 62 (2001), 589-607.
5. F. Behrend, On sequences of integers containing no arithmetic progression, Časopis P̌est Mat 67 (1938), 235-239.
6. M. Bellare, D. Coppersmith, J. Håstad, M. Kiwi, and M. Sudan, Linearity testing in characteristic two, IEEE Trans Inf Theory 42(6) (November 1996), 1781-1796.
7. M. Bellare, O. Goldreich, and M. Sudan, Free bits, PCP's and non-approximability - towards tight results, SIAM J Comput 27(3) (1998), 804-915.
8. M. Blum, M. Luby, and R. Rubinfeld, Self-testing/correcting with applications to numerical problems, J Comput Syst Sci 47 (1993), 549-595.
9. L. Engebretsen, "The non-approximability of non-Boolean predicates," Lecture notes (vol. 2129) in Computer Science, M. Goemans, K. Jansen, J. D. P. Rolim, and L. Trevisan (Editors), Proc of 5th International Workshop on Randomization and Approximation Techniques in Computer Science, Springer-Verlag, Berkeley, California, 2001, pp. 241-248.
10. U. Feige, A threshold of ln n for approximating set cover, J ACM 45 (1998), 634-652.
11. U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy, Interactive proofs and the hardness of approximating cliques, J ACM 43(2) (1996), 268-292.
12. J. Håstad, Some optimal inapproximability results, J ACM 48 (2001), 798-859.
13. M. Kiwi, Probabilistically checkable proofs and the testing of Hadamard-like codes, Ph.D. Thesis, Massachusetts Institute of Technology, Cambridge, MA, 1996.
14. N. Nisan and A. Wigderson, Hardness vs. randomness, J Comput Syst Sci 49(2) (1994), 149-167.
15. R. Raz, A parallel repetition theorem, SIAM J Comput 27(3) (1998), 763-803.
16. I. Z. Ruzsa and E. Szemeredi, Triple systems with no six points carrying three triangles, Colloq Math Soc J Bolyai 18 (1978), 939-945.
17. A. Samorodnitsky and Luca Trevisan, A PCP characterization of NP with optimal amortized query complexity, Proc 32nd STOC, Portland, Oregon, 2000, pp. 191-199.