Combinatorial PCPs with efficient verifiers

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2009, Pages 463-471

  Meir, Or ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC METHOD; COMBINATORIAL PROOF; COMBINATORIAL TECHNIQUES; INTUITIVE PROOF; PCP THEOREM;

ALGEBRA; COMPUTER SCIENCE; FIBER OPTIC CHEMICAL SENSORS;

THEOREM PROVING;

EID: 77952412084     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2009.10     Document Type: Conference Paper

References (12)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, "Proof verification and intractability of approximation problems," Journal of ACM, vol. 45, no. 3, pp. 501-555, 1998, preliminary version in FOCS 1992.
2. S. Arora and S. Safra, "Probabilistic checkable proofs: A new characterization of NP," Journal of ACM volume, vol. 45, no. 1, pp. 70-122, 1998, preliminary version in FOCS 1992.
3. L. Babai, L. Fortnow, L. A. Levin, and M. Szegedy, "Checking computations in polylogarithmic time," in STOC, 1991, pp. 21-31.
4. L. Babai, L. Fortnow, and C. Lund, "Non-deterministic exponential time has two-prover interactive protocols," Computational Complexity, vol. 1, pp. 3-40, 1991.
5. B. Barak and O. Goldreich, "Universal arguments and their applications," in IEEE Conference on Computational Complexity, 2002, pp. 194-203.
6. E. Ben-Sasson, O. Goldreich, P. Harsha, M. Sudan, and S. Vadhan, "Short PCPs verifiable in polylogarithmic time," pp. 120-134, 2005.
7. -, "Robust PCPs of proximity, shorter PCPs and applications to coding," SIAM Journal of Computing, vol. 36, no. 4, pp. 120-134, 2006.
8. E. Ben-Sasson and M. Sudan, "Simple PCPs with poly-log rate and query complexity," in STOC, 2005, pp. 266-275, full version can be obtained from Eli Ben-Sasson's homepage at http://www.cs.technion.ac.il/~eli/.
9. I. Dinur, "The PCP Theorem by gap amplification," Journal of ACM, vol. 54, no. 3, pp. 241-250, 2007, preliminary version in STOC 2006.
10. I. Dinur and O. Reingold, "Assignment testers: Towards combinatorial proof of the PCP theorem," SIAM Journal of Computing, vol. 36, no. 4, pp. 155-164, 2006.
11. A. Polishchuk and D. A. Spielman, "Nearly-linear size holographic proofs," in STOC, 1994, pp. 194-203.
12. M. Szegedy, "Many-valued logics and holographic proofs," in ICALP, 1999, pp. 676-686.