Assignment testers: Towards a combinatorial proof of the PCP theorem

SIAM Journal on Computing

Volumn 36, Issue 4, 2006, Pages 975-1024

  Dinur, Irit ^a   Reingold, Omer ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Assignment tester; Combinatorial proof; PCP theorem

Indexed keywords

COMBINATORIAL OPTIMIZATION; ERROR CORRECTION; THEOREM PROVING; VERIFICATION;

ALGEBRAIC PROOF TECHNIQUES; ASSIGNMENT TESTER; COMBINATORIAL PROOF; PCP THEOREM;

PROBABILISTIC LOGICS;

EID: 34547829715     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539705446962     Document Type: Article

References (31)

1. S. ARORA, C. LUND, R. MOTWANI, M. SUDAN, AND M. SZEGEDY, Proof verification and the hardness of approximation problems, J. ACM, 45 (1998), pp. 501-555.
2. S. ARORA AND S. SAFRA, Probabilistic checking of proofs: A new characterization of NP, J. ACM, 45 (1998), pp. 70-122.
3. L. BABAI, Trading group theory for randomness, in Proceedings of the 17th ACM Symposium on Theory of Computing, Providence, RI, 1985, ACM, New York, 1985, pp. 421-429.
4. L. BABAI, L. FORTNOW, L. LEVIN, AND M. SZEGEDY, Checking computations in polylogarithmic time, in Proceedings of the 23rd ACM Symposium on Theory of Computing, New Orleans, LA, 1991, ACM, New York, 1991, pp. 21-31.
5. L. BABAI, L. FORTNOW, AND C. LUND, Non-deterministic exponential time has two-prover interactive protocols, Comput. Complexity, 1 (1991), pp. 3-40.
6. M. BELLARE, O. GOLDREICH, AND M. SUDAN, Free bits, PCPs, and nonapproximability-Towards tight results, SIAM J. Comput., 27 (1998), pp. 804-915.
7. M. BEN-OR, S. GOLDWASSER, J. KILIN, AND A. WIGDERSON, Multi prover interactive proofs: How to remove intractability assumptions, in Proceedings of the 20th ACM Symposium on Theory of Computing, Chicago, IL, 1988, ACM, New York, 1988, pp. 113-121.
8. E. BEN-SASSON, O. GOLDREICH, P. HARSHA, M. SUDAN, AND S. VADHAN, Robust PCPs of proximity, shorter peps and applications to coding, in Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, 2004, ACM, New York, 2004, pp. 1-10.
9. M. CAPALBO, O. REINGOLD, S. VADHAN, AND A. WIGDERSON, Randomness conductors and constant-degree lossless expanders, in Proceedings of the 34th Annual ACM Symposium on Theory of Computing, Montréal, QC, 2002, ACM, New York, 2002, pp. 659-668.
10. T. H. CORMEN, C. E. LEISERSON, AND R. L. RIVEST, Introduction to Algorithms, MIT Press/McGraw-Hill, New York, 1990.
11. I. DINUR, The PCP theorem by gap amplification, in Proceedings of the 38th ACM Symposium on Theory of Computing, 2006, ACM, New York, pp. 241-250.
12. F. ERGUN, R. KUMAR, AND R. RUBINFELD, Fast approximate PCPs, in Proceedings of the 31st ACM Symposium on Theory of Computing, Atlanta, GA, 1999, ACM, New York, 1999, pp. 41-50.
13. U. FEIGE, S. GOLDWASSER, L. LOVÁSZ, S. SAFRA, AND M. SZEGEDY, Approximating clique is almost NP-complete, J. ACM, 43 (1996), pp. 268-292.
14. U. FEIGE AND J. KILIAN, TWO prover protocols-Low error at affordable rates, in Proceedings of the 26th ACM Symposium on Theory of Computing, Montréal, QC, 1994, ACM, New York, 1994, pp. 172-183.
15. L. FORTNOW, J. ROMPEL, AND M. SIPSER, On the power of multi-prover interactive protocols, Theoret. Comput. Sci., 134 (1994), pp. 545-557.
16. R. G. GALLAGER, LOW Density Parity Check Codes, MIT Press, Cambridge, MA, 1963.
17. O. GOLDREICH, A sample of samplers - A computational perspective on sampling (survey), Electronic Colloquium on Computational Complexity (ECCC), 4 (1997); available online at http://eccc.hpi-web.de/eccc- reports/1997/TR97-020/index.html.
18. O. GOLDREICH, S. GOLDWASSER, AND D. RON, Property testing and its connection to learning and approximation, J. ACM, 45 (1998), pp. 653-750.
19. O. GOLDREICH AND S. SAFRA, A combinatorial consistency lemma with application to proving the PCP theorem, SIAM J. Comput., 29 (2000), pp. 1132-1154.
20. S. GOLDWASSER, S. MICALI, AND C. RACKOFF, The knowledge complexity of interactive proofs, SIAM J. Comput., 18 (1989), pp. 186-208.
21. A. LUBOTZKY, R. PHILLIPS, AND P. SARNAK, Ramanujan graphs, Combinatorica, 8 (1988), pp. 261-277.
22. C. LUND, L. FORTNOW, H. KARLOFF, AND N. NISAN, Algebraic methods for interactive proof systems, J. ACM, 39 (1992), pp. 859-868.
23. A. POLISHCHUK AND D. SPIELMAN, Nearly linear size holographic proofs, in Proceedings of the 26th ACM Symposium on Theory of Computing, Montréal, QC, 1994, ACM, New York, 1994, pp. 194-203.
24. R. RAZ, A parallel repetition theorem, SIAM J. Comput., 27 (1998), pp. 763-803.
25. O. REINGOLD, S. VADHAN, AND A. WIGDERSON, Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors, in Proceedings of the 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, CA, 2000, IEEE Press, Piscataway, NJ, 2000, pp. 3-13.
26. R. RUBINFELD AND M. SUDAN, Robust characterizations of polynomials with applications to program testing, SIAM J. Comput., 25 (1996), pp. 252-271.
27. A. SHAMIR, IP = PSPACE, J. ACM, 39 (1992), pp. 869-877.
28. M. SIPSER AND D. A. SPIELMAN, Expander codes, IEEE Trans. Inform. Theory, 42 (1996), pp. 1710-1722.
29. D. A. SPIELMAN, Linear-time encodable and decodable error-correcting codes, IEEE Trans. Inform. Theory, 42 (1996), pp. 1723-1731.
30. M. SZEGEDY, Many-valued logics and holographic proofs, in Proceedings of ICALP'99, Prague, Czech Republic, 1999, Lecture Notes in Comput. Sci. 1644, Springer, New York, 1999, pp. 676-686.
31. R. M. TANNER, A recursive approach to low complexity codes, IEEE Trans. Inform. Theory, IT-27 (1981), pp. 533-547.