TY - JOUR
T1 - Derandomized Parallel Repetition via Structured PCPs
AU - Dinur, Irit
AU - Meir, Or
N1 - Funding Information:
Irit Dinur is supported in part by the Israel Science Foundation and by the Binational Science Foundation and by an ERC grant. Or Meir is supported in part by the Israel Science Foundation (grant No. 1041/08) and by the Adams Fellowship Program of the Israel Academy of Sciences and Humanities. An extended abstract of this paper has appeared as Dinur & Meir (2010).
PY - 2011/6
Y1 - 2011/6
N2 - A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof and in return is allowed to err with some bounded probability. The probability that the verifier accepts a proof of a false claim is called the soundness error and is an important parameter of a PCP system that one seeks to minimize. Constructing PCPs with subconstant soundness error and, at the same time, a minimal number of queries into the proof (namely two) is especially important due to applications for inapproximability. In this work, we construct such PCP verifiers, i.e., PCPs that make only two queries and have subconstant soundness error. Our construction can be viewed as a combinatorial alternative to the "manifold vs. point" construction, which is the basis for all constructions in the literature for this parameter range. The "manifold vs. point" PCP is based on a low-degree test, while our construction is based on a direct product test. We also extend our construction to yield a decodable PCP (dPCP) with the same parameters. By plugging in this dPCP into the scheme of Dinur and Harsha (FOCS 2009), one gets an alternative construction of the result of Moshkovitz and Raz (FOCS 2008), namely a construction of two-query PCPs with small soundness error and small alphabet size. Our construction of a PCP is based on extending the derandomized direct product test of Impagliazzo, Kabanets, and Wigderson (STOC 09) to a derandomized parallel repetition theorem. More accurately, our PCP construction is obtained in two steps. We first prove a derandomized parallel repetition theorem for specially structured PCPs. Then, we show that any PCP can be transformed into one that has the required structure, by embedding it on a de-Bruijn graph.
AB - A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof and in return is allowed to err with some bounded probability. The probability that the verifier accepts a proof of a false claim is called the soundness error and is an important parameter of a PCP system that one seeks to minimize. Constructing PCPs with subconstant soundness error and, at the same time, a minimal number of queries into the proof (namely two) is especially important due to applications for inapproximability. In this work, we construct such PCP verifiers, i.e., PCPs that make only two queries and have subconstant soundness error. Our construction can be viewed as a combinatorial alternative to the "manifold vs. point" construction, which is the basis for all constructions in the literature for this parameter range. The "manifold vs. point" PCP is based on a low-degree test, while our construction is based on a direct product test. We also extend our construction to yield a decodable PCP (dPCP) with the same parameters. By plugging in this dPCP into the scheme of Dinur and Harsha (FOCS 2009), one gets an alternative construction of the result of Moshkovitz and Raz (FOCS 2008), namely a construction of two-query PCPs with small soundness error and small alphabet size. Our construction of a PCP is based on extending the derandomized direct product test of Impagliazzo, Kabanets, and Wigderson (STOC 09) to a derandomized parallel repetition theorem. More accurately, our PCP construction is obtained in two steps. We first prove a derandomized parallel repetition theorem for specially structured PCPs. Then, we show that any PCP can be transformed into one that has the required structure, by embedding it on a de-Bruijn graph.
KW - PCP
KW - de-Bruijn
KW - derandomized parallel repetition
KW - direct product
KW - direct product test
KW - low error
UR - http://www.scopus.com/inward/record.url?scp=79960562417&partnerID=8YFLogxK
U2 - 10.1007/s00037-011-0013-5
DO - 10.1007/s00037-011-0013-5
M3 - Article
AN - SCOPUS:79960562417
VL - 20
SP - 207
EP - 327
JO - Computational Complexity
JF - Computational Complexity
SN - 1016-3328
IS - 2
ER -