The PCP theorem by gap amplification

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 241-250

  Dinur, Irit ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Gap amplification; PCP

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; CONSTRAINT THEORY; MATHEMATICAL TRANSFORMATIONS; PROBABILISTIC LOGICS;

AMPLIFICATION TRANSFORMATION; GAP AMPLIFICATION; PCP THEOREM; POLYLOG FACTOR;

THEOREM PROVING;

EID: 33748103149     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1132516.1132553     Document Type: Conference Paper

References (20)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and intractability of approximation problems. J. ACM, 45(3):501-555, 1998.
2. S. Arora and S. Safra, Probabilistic checking of proofs: A new characterization of NP. J. ACM, 45(1):70-122, 1998.
3. E. Ben-Sasson, O. Goldreich, P. Harsha, M. Sudan, and S. Vadhan. Robust PCPs of proximity, shorter PCPs and applications to coding. In Proc. 36th ACM Symp. on Theory of Computing, 2004.
4. E. Ben-Sasson and M. Sudan. Robust PCPs of proximity, shorter PCPs and applications to coding. In Proc. 37th ACM Symp. on Theory of Computing, 2005.
5. E. Ben-Sasson, M. Sudan, S. P. Vadhan, and A. Wigderson. Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. In Proc. 35th ACM Symp. on Theory of Computing, pages 612-621, 2003.
6. A. Bogdanov. Gap amplification fails below 1/2. Comment on ECCC TR05-046, 2005.
7. I. Dinur and O. Reingold. Assignment testers: Towards combinatorial proofs of the PCP theorem. In Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS), 2004.
8. U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy. Approximating clique is almost NP-complete. Journal of the ACM, 43(2):268-292, 1996.
9. U. Feige and J. Kilian. Impossibility results for recycling random bits in two-prover proof systems. In Proc. 27th ACM Symp. on Theory of Computing, pages 457-468, 1995.
10. O. Goldreich and S. Safra. A combinatorial consistency lemma with application to proving the PCP theorem. In RANDOM. LNCS, 1997.
11. O. Goldreich and M. Sudan. Locally testable codes and PCPs of almost-linear length. In Proc. 43rd IEEE Symp. on Foundations of Computer Science, pages 13-22, 2002.
12. P. Harsha and M. Sudan. Small PCPs with low query complexity. In STAGS, pages 327-338, 2001.
13. N. Linial and A. Wigderson. Expander graphs and their applications. Lecture notes of a course: http://www.math.ias.edu/boaz/ExpanderCourse/, 2003.
14. C. Papadimitriou and M. Yannakakis. Optimization, approximation and complexity classes. Journal of Computer and System Sciences, 43:425-440, 1991.
15. A. Polishchuk and D. Spielman. Nearly linear size holographic proofs. In Proc. 26th ACM Symp. on Theory of Computing, pages 194-203, 1994.
16. J. Radhakrishnan. Private communication. 2005.
17. R. Raz. A parallel repetition theorem. SIAM Journal on Computing, 27(3):763-803, June 1998.
18. O. Reingold. Undirected st-connectivity in log-space. In Proc. 37th ACM Symp. on Theory of Computing, 2005.
19. O. Reingold, S. Vadhan, and A. Wigderson. Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors. Annals of Mathematics, 155(1):157-187, 2002.
20. M. Sipser and D. A. Spielman. Expander codes. IEEE Trans. Inform. Theory, 42(6, part 1):1710-1722, 1996, Codes and complexity.