TY - GEN
T1 - Towards an optimal query efficient PCP?
AU - Khot, Subhash
AU - Safra, Muli
AU - Tulsiani, Madhur
PY - 2013
Y1 - 2013
N2 - We construct a PCP based on the hyper-graph linearity test with 3 free queries. It has near-perfect completeness and soundness strictly less than 1/8. Such a PCP was known before only assuming the Unique Games Conjecture, albeit with soundness arbitrarily close to 1/16. At a technical level, our main contribution is constructing a new outer PCP which is "robust" against bounded degree polynomials, and showing that it can be composed with the hyper-graph linearity test with 3 free queries. We believe this outer PCP may be useful in obtaining the optimal query vs. soundness tradeoff for PCPs.
AB - We construct a PCP based on the hyper-graph linearity test with 3 free queries. It has near-perfect completeness and soundness strictly less than 1/8. Such a PCP was known before only assuming the Unique Games Conjecture, albeit with soundness arbitrarily close to 1/16. At a technical level, our main contribution is constructing a new outer PCP which is "robust" against bounded degree polynomials, and showing that it can be composed with the hyper-graph linearity test with 3 free queries. We believe this outer PCP may be useful in obtaining the optimal query vs. soundness tradeoff for PCPs.
KW - CSPs
KW - PCPs
KW - hardness of approximation
UR - http://www.scopus.com/inward/record.url?scp=84873374683&partnerID=8YFLogxK
U2 - 10.1145/2422436.2422458
DO - 10.1145/2422436.2422458
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84873374683
SN - 9781450318594
T3 - ITCS 2013 - Proceedings of the 2013 ACM Conference on Innovations in Theoretical Computer Science
SP - 173
EP - 186
BT - ITCS 2013 - Proceedings of the 2013 ACM Conference on Innovations in Theoretical Computer Science
T2 - 2013 4th ACM Conference on Innovations in Theoretical Computer Science, ITCS 2013
Y2 - 9 January 2013 through 12 January 2013
ER -