Answers are grounded in this paper and cite their sources.
Samorodnitsky and Trevisan [STOC 2000, pp. 191–199] proved that there exists, for every positive integerk, a PCP forNPwithO(logn) randomness, query complexity 2k+k2, free bit complexity 2k, completeness 1 ‐ϵ, and soundness 2 +ϵ. In this article, we devise a new “outer verifier,” based on the layered label cover problem recently introduced by Dinur et al. [STOC 2003, pp. 595–601], and combine it with a new “inner verifier” that uses the query bits more efficiently than earlier verifiers. Our resulting theorem is that there exists, for every integerf≥ 2, every positive integert≤f(f‐ 1)/2, and every constantϵ> 0, a PCP forNPwithO(logn) randomness, query complexityf+t, free bit complexityf, completeness 1 ‐ϵ, and soundness 2‐t+ϵ. As a corollary, there exists, for every integerq≥ 3 and every constantϵ> 0, aq‐query PCP forNPwith amortized query complexity 1 +1 + √2/q + ε +ϵ. This improves upon the result of Samorodnitsky and Trevisan with respect to query efficiency, i.e., the relation between soundness and the number of queries. Although the improvement may seem moderate—the construction of Samorodnitsky and Trevisan has amortized query complexity 1 + 2/1 + 2/√q + ε —we also show in this article that combining our outer verifier with any natural candidate for a corresponding inner verifier gives a PCP that is less query efficient than the one we obtain.
No takes yet. Share an insight, caveat, or question.
Engebretsen et al. (2008) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: