Abstract
In the PCP model, a verifier is supposed to probabilistically decide if a given input belongs to some language by posing queries to a purported proof of this fact. The probability that the verifier accepts an input in the language given a correct proof is called the completeness c; the probability that the verifier rejects an input not in the language given any proof is called the soundness s. For a verifier posing q queries to the proof, the amortized query complexity is defined by q / log2(c/s) if the proof is coded in binary. It is a measure of the average “efficiency” of the queries in the following sense: An ideal query should preserve the completeness and halve the soundness. If this were the case for all queries, the amortized query complexity would be exactly one.
Samorodnitsky and Trevisan [STOC 2000] gave a q-query PCP for NP with amortized query complexity 1+2/ \(\sqrt{q}+\varepsilon\) for any constant ε > 0. In this paper, we examine to what extent their result can be sharpened. Using the layered label cover problem recently introduced by Dinur et al. [STOC 2003], we devise a new “outer verifier” that allows us to construct an “inner verifier” that uses the query bits more efficiently than earlier verifiers. This enables us to construct a PCP for NP that queries q positions in the proof and has amortized query complexity \(1+2/ \sqrt{q}+\varepsilon\). As an immediate corollary, we also obtain an improved hardness of approximation result for the Maximum q-CSP problem.
Since the improvement compared to previous work is moderate, we then examine if there is an underlying reason for this. Our construction in this paper follows a paradigm for query efficient PCPs for NP outlined by many previous researchers and it combines a state-of-the-art “outer verifier” with a natural candidate for a query efficient “inner verifier”. We prove in the full version of this paper that all natural attempts to construct more query efficient versions of our verifier are doomed to fail. This implies that significantly new ideas regarding proof composition and encoding of PCP proofs are required to construct PCPs for NP that are more query efficient than the one we propose in his paper.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness 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)
Bellare, M., Goldreich, O., Sudan, M.: Free bits, PCPs and non-approximability—towards tight results. SIAM J. Comput. 27(3), 804–915 (1998)
Bellare, M., Sudan, M.: Improved non-approximability results. In: Proc. 26th STOC, pp. 184–193 (1994)
Blum, M., Luby, M., Rubinfeld, R.: Self-testing correcting with applications to numerical problems. J. Comput. Syst. Sci. 47(3), 549–595 (1993)
Dinur, I., Guruswami, V., Khot, S., Regev, O.: A new multilayered PCP and the hardness of hypergraph vertex cover. In: Proc. 35th STOC, pp. 595–601 (2003)
Engebretsen, L.: The nonapproximability of non-Boolean predicates. SIAM J. Disc. Math. 18(1), 114–129 (2004)
Engebretsen, L., Holmerin, J.: Three-query PCPs with perfect completeness over non-Boolean domains. In: Proc. 18th CCC, pp. 284–299 (2003)
Engebretsen, L., Holmerin, J.: More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP. Technical Report TRITA-NA-0409, Royal Institute of Technology (April 2004)
Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45(4), 634–652 (1998)
Hast, G.: Approximating MAX kCSP using random restrictions. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol. 3122, pp. 151–162. Springer, Heidelberg (2004)
Håstad, J.: Some optimal inapproximability results. J. ACM 48(4), 798–859 (2001)
Håstad, J., Khot, S.: Query efficient PCPs with perfect completeness. In: Proc. 42nd FOCS, pp. 610–619 (2001)
Håstad, J., Wigderson, A.: Simple analysis of graph tests for linearity and PCP. Random Struct. and Alg. 22(2), 139–160 (2003)
Raz, R.: A parallel repetition theorem. SIAM J. Comput. 27(3), 763–803 (1998)
Samorodnitsky, A., Trevisan, L.: A PCP characterization of NP with optimal amortized query complexity. In: Proc. 32nd STOC, pp. 191–199 (2000)
Sudan, M., Trevisan, L.: Probabilistically checkable proofs with low amortized query complexity. In: Proc. 39th FOCS, pp. 18–27 (1998)
Trevisan, L.: Recycling queries in PCPs and in linearity tests. In: Proc. 30th STOC, pp. 299–308 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Engebretsen, L., Holmerin, J. (2005). More Efficient Queries in PCPs for NP and Improved Approximation Hardness of Maximum CSP. In: Diekert, V., Durand, B. (eds) STACS 2005. STACS 2005. Lecture Notes in Computer Science, vol 3404. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31856-9_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-31856-9_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24998-6
Online ISBN: 978-3-540-31856-9
eBook Packages: Computer ScienceComputer Science (R0)