论文信息 - Revisiting Alphabet Reduction in Dinur's PCP

Revisiting Alphabet Reduction in Dinur's PCP

Dinur’s celebrated proof of the PCP theorem alternates two main steps in several iterations: gap amplification to increase the soundness gap by a large constant factor (at the expense of much larger alphabet size), and a composition step that brings back the alphabet size to an absolute constant (at the expense of a fixed constant factor loss in the soundness gap). We note that the gap amplification can produce a Label Cover CSP. This allows us to reduce the alphabet size via a direct long-code based reduction from Label Cover to a Boolean CSP. Our composition step thus bypasses the concept of Assignment Testers from Dinur’s proof, and we believe it is more intuitive - it is just a gadget reduction. The analysis also uses only elementary facts (Parseval’s identity) about Fourier Transforms over the hypercube.

[1] Dan Suciu,et al. Journal of the ACM , 2006 .

[2] Omer Reingold,et al. Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem , 2004, FOCS.

[3] Mihir Bellare,et al. Free Bits, PCPs, and Nonapproximability-Towards Tight Results , 1998, SIAM J. Comput..

[4] Eli Ben-Sasson,et al. Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding , 2004, SIAM J. Comput..

[5] Venkatesan Guruswami,et al. (2+ε)-Sat Is NP-hard , 2014, SIAM J. Comput..

[6] Uriel Feige,et al. The Pcp Theorem and Hardness of Approximation , 2003 .

[7] Carsten Lund,et al. Proof verification and the hardness of approximation problems , 1998, JACM.

[8] J. Radhakrishnan,et al. On Dinur’s proof of the PCP theorem , 2006 .

[9] Assaf Naor,et al. Boolean functions whose Fourier transform is concentrated on the first two levels , 2002, Adv. Appl. Math..

[10] Sanjeev Arora,et al. Probabilistic checking of proofs; a new characterization of NP , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.