Abstract
We show an alternative implementation of the gap amplification step in Dinur’s [4] recent proof of the PCP theorem. We construct a product G t of a constraint graph G, so that if every assignment in G leaves an ε-fraction of the edges unsatisfied, then in G t every assignment leaves an Ω(tε)-fraction of the edges unsatisfied, that is, it amplifies the gap by a factor Ω(t). The corresponding result in [4] showed that one could amplify the gap by a factor \(\Omega(\sqrt{t})\). More than this small quantitative improvement, the main contribution of this work is in the analysis. Our construction uses random walks on expander graphs with exponentially distributed length. By this we ensure that some random variables arising in the proof are automatically independent, and avoid some technical difficulties.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and intractability of approximation problems. J. ACM 45(3), 501–555 (1998)
Arora, S., Safra, S.: Probabilistic checking of proofs: A new characterization of NP. J. ACM 45(1), 70–122 (1998)
Babai, L., Fortnow, L., Levin, L.A., Szegedy, M.: Checking Computations in Polylogarithmic Time. In: STOC 1991, pp. 21–31 (1991)
Dinur, I.: The PCP Theorem by Gap Amplification. ECCC TR05-046, http://eccc.uni-trier.de/eccc-reports/2005/TR05-046
Feige, U., Goldwasser, S., Lovász, L., Safra, S., Szegedy, M.: Approximating the clique is almost NP-complete. J. ACM 43(2), 268–292 (1996)
O’Donnell, R., Guruswami, V.: Course notes of CSE 533: The PCP Theorem and Hardness of Approximation, http://www.cs.washington.edu/education/courses/533/05au/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Radhakrishnan, J. (2006). Gap Amplification in PCPs Using Lazy Random Walks. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds) Automata, Languages and Programming. ICALP 2006. Lecture Notes in Computer Science, vol 4051. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11786986_10
Download citation
DOI: https://doi.org/10.1007/11786986_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35904-3
Online ISBN: 978-3-540-35905-0
eBook Packages: Computer ScienceComputer Science (R0)