Abstract
We initiate the study of the trade-off between the length of a probabilistically checkable proof of proximity (PCPP) and the maximal soundness that can be guaranteed by a 3-query verifier with oracle access to the proof. Our main observation is that a verifier limited to querying a short proof cannot obtain the same soundness as that obtained by a verifier querying a long proof. Moreover, we quantify the soundness deficiency as a function of the proof-length and show that any verifier obtaining “best possible” soundness must query an exponentially long proof.
In terms of techniques, we focus on the special class of inspective verifiers that read at most 2 proof-bits per invocation. For such verifiers, we prove exponential length-soundness trade-offs that are later on used to imply our main results for the case of general (i.e., not necessarily inspective) verifiers. To prove the exponential trade-off for inspective verifiers, we show a connection between PCPP proof length and property-testing query complexity that may be of independent interest. The connection is that any linear property that can be verified with proofs of length ℓ by linear inspective verifiers must be testable with query complexity ≈ logℓ.
- Arora, S., Lund, C., Motwani, R., Sudan, M., and Szegedy, M. 1998. Proof verification and the hardness of approximation problems. J. ACM 45, 3, 501--555. doi: 10.1145/278298.278306. Google Scholar
Digital Library
- Arora, S. and Safra, S. 1998. Probabilistic checking of proofs: A new characterization of NP. J. ACM 45, 1, 70--122. doi: 10.1145/273865.273901. Google Scholar
Digital Library
- Babai, L., Fortnow, L., Levin, L. A., and Szegedy, M. 1991. Checking computations in polylogarithmic time. In Proceedings of the 23rd ACM Symposium on Theory of Computing (STOC). ACM, 21--31. doi: 10.1145/103418.103428. Google Scholar
Digital Library
- Bellare, M., Coppersmith, D., Håstad, J., Kiwi, M. A., and Sudan, M. 1996. Linearity testing in characteristic two. IEEE Trans. Inform. Theor. 42, 6, 1781--1795. doi: 10.1109/18.556674. Google Scholar
Cross Ref
- Ben-Sasson, E., Goldreich, O., Harsha, P., Sudan, M., and Vadhan, S. 2006. Robust PCPs of proximity, shorter PCPs and applications to coding. SIAM J. Comput. 36, 4, 889--974. doi: 10.1137/S0097539705446810. Google Scholar
Digital Library
- Ben-Sasson, E., Goldreich, O., and Sudan, M. 2003. Bounds on 2-query codeword testing. In Proceedings of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM), S. Arora and A. Sahai, Eds. Lecture Notes in Computer Science, vol. 2764. Springer, 216--227. doi: 10.1007/b11961.Google Scholar
- Ben-Sasson, E., Harsha, P., Lachish, O., and Matsliah, A. 2008. Sound 3-query PCPPs are long. In Proceedings of the 35th International Colloquium of Automata, Languages and Programming (ICALP), Part I, L. Aceto, I. Damgȧrd, L. A. Goldberg, M. M. Halldórsson, A. Ingólfsdóttir, and I. Walukiewicz, Eds. Lecture Notes in Computer Science, vol. 5125. Springer, 686--697. doi: 10.1007/978-3-540-70575-8_56. Google Scholar
Digital Library
- Ben-Sasson, E., Harsha, P., and Raskhodnikova, S. 2005. Some 3CNF properties are hard to test. SIAM J. Comput. 35, 1, 1--21. doi: 10.1137/S0097539704445445. Google Scholar
Digital Library
- Ben-Sasson, E. and Sudan, M. 2008. Short PCPs with polylog query complexity. SIAM J. Comput. 38, 2, 551--607. doi: 10.1137/050646445. Google Scholar
Digital Library
- Ben-Sasson, E., Sudan, M., Vadhan, S., and Wigderson, A. 2003. Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. In Proceedings of the 35th ACM Symposium on Theory of Computing (STOC). ACM, 612--621. doi: 10.1145/780542.780631. Google Scholar
Digital Library
- Bogdanov, A. 2005. Gap amplification fails below 1/2. Tech. rep. TR05-046, Electronic Colloquium on Computational Complexity. http://eccc.hpi-web.de/eccc-reports/2005/TR05-046/index.html.Google Scholar
- Charikar, M., Makarychev, K., and Makarychev, Y. 2006. Near-optimal algorithms for unique games. In Proceedings of the 38th ACM Symposium on Theory of Computing (STOC). ACM, 205--214. doi: 10.1145/1132516.1132547. Google Scholar
Digital Library
- Dinur, I. 2007. The PCP theorem by gap amplification. J. ACM 54, 3, 12. doi: 10.1145/1236457.1236459. Google Scholar
Digital Library
- Dinur, I. and Reingold, O. 2006. Assignment testers: Towards a combinatorial proof of the PCP Theorem. SIAM J. Comput. 36, 975--1024. doi: 10.1137/S0097539705446962. Google Scholar
Digital Library
- Engebretsen, L. and Holmerin, J. 2008. More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP. Rand. Struct. Algor. 33, 4, 497--514. doi: 10.1002/rsa.20226. Google Scholar
Digital Library
- Ergün, F., Kumar, R., and Rubinfeld, R. 2004. Fast approximate probabilistically checkable proofs. Inform. Computat. 189, 2, 135--159. doi: 10.1016/j.ic.2003.09.005. Google Scholar
Digital Library
- Feige, U. and Kilian, J. 1995. Impossibility results for recycling random bits in two-prover proof systems. In Proceedings of the 27th ACM Symposium on Theory of Computing (STOC). ACM, 457--468. doi: 10.1145/225058.225183. Google Scholar
Digital Library
- Fischer, E. 2001. The art of uninformed decisions: A primer to property testing. Bull. Eur. Assoc. Theoret. Comput. Sci. 75, 97--126. The Computational Complexity Column. http://theorie.informatik.uni-ulm.de/Personen/toran/beatcs/.Google Scholar
- Fischer, E. and Fortnow, L. 2006. Tolerant versus intolerant testing for Boolean properties. Theor. Comput. 2, 1, 173--183. doi: 10.4086/toc.2006.v002a009.Google Scholar
Cross Ref
- Gallager, R. G. 1963. Low Density Parity Check Codes. MIT Press, Cambridge, MA.Google Scholar
- Goldreich, O., Goldwasser, S., and Ron, D. 1998. Property testing and its connection to learning and approximation. J. ACM 45, 4, 653--750. doi: 10.1145/285055.285060. Google Scholar
Digital Library
- Goldreich, O. and Sudan, M. 2006. Locally testable codes and PCPs of almost linear length. J. ACM 53, 4, 558--655. doi: 10.1145/1162349.1162351. Google Scholar
Digital Library
- Gupta, A. and Talwar, K. 2006. Approximating unique games. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, 99--106. doi: 10.1145/1109557.1109569. Google Scholar
Digital Library
- Guruswami, V. 2006. On 2-query codeword testing with near-perfect completeness. In Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC), T. Asano, Ed. Lecture Notes in Computer Science, vol. 4288. Springer, 267--276. doi: 10.1007/11940128_28.Google Scholar
- Guruswami, V., Lewin, D., Sudan, M., and Trevisan, L. 1998. A tight characterization of NP with 3-query PCPs. In Proceedings of the 39th IEEE Symposium on Foundations of Computer Science (FOCS). IEEE, 18--27. doi: 10.1109/SFCS.1998.743424. Google Scholar
Digital Library
- Guruswami, V. and Rudra, A. 2005. Tolerant locally testable codes. In Proceedings of the 9th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM), C. Chekuri, K. Jansen, J. D. P. Rolim, and L. Trevisan, Eds. Lecture Notes in Computer Science, vol. 3624. Springer, 306--317. doi: 10.1007/11538462_26. Google Scholar
Digital Library
- Harsha, P. and Sudan, M. 2000. Small PCPs with low query complexity. Computat. Complex. 9, 3--4, 157--201. doi: 10.1007/PL00001606.Google Scholar
Cross Ref
- Håstad, J. 2001. Some optimal inapproximability results. J. ACM 48, 4, 798--859. doi: 10.1145/502090.502098. Google Scholar
Digital Library
- Håstad, J. and Khot, S. 2005. Query efficient pcps with perfect completeness. Theor. Comput. 1, 1, 119--148. doi: 10.4086/toc.2005.v001a007.Google Scholar
Cross Ref
- Katz, J. and Trevisan, L. 2000. On the efficiency of local decoding procedures for error-correcting codes. In Proceedings of the 32nd ACM Symposium on Theory of Computing (STOC). ACM, 80--86. doi: 10.1145/335305.335315. Google Scholar
Digital Library
- Kerenidis, I. and de Wolf, R. 2004. Exponential lower bound for 2-query locally decodable codes via a quantum argument. J. Comput. Syst. Sci. 69, 3, 395--420. doi: 10.1016/j.jcss.2004.04.007. Google Scholar
Digital Library
- Khot, S. 2002. On the power of unique 2-prover 1-round games. In Proceedings of the 34th ACM Symposium on Theory of Computing (STOC). ACM, 767--775. doi: 10.1145/509907.510017. Google Scholar
Digital Library
- Khot, S. and Saket, R. 2006. A 3-query nonadaptive PCP with perfect completeness. In Proceedings of the 21st IEEE Conference on Computational Complexity. IEEE, 159--169. doi: 10.1109/CCC.2006.5. Google Scholar
Digital Library
- Kilian, J. 1992. A note on efficient zero-knowledge proofs and arguments (extended abstract). In Proceedings of the 24th ACM Symposium on Theory of Computing (STOC). ACM, 723--732. doi: 10.1145/129712.129782. Google Scholar
Digital Library
- Leighton, F. T. and Rao, S. 1999. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM 46, 6, 787--832. doi: 10.1145/331524.331526. Google Scholar
Digital Library
- Micali, S. 2000. Computationally sound proofs. SIAM J. Comput. 30, 4, 1253--1298. doi: 10.1137/S0097539795284959. Google Scholar
Digital Library
- Moshkovitz, D. and Raz, R. 2007. Sub-constant error probabilistically checkable proof of almost linear size. Tech. rep. TR07-026, Electronic Colloquium on Computational Complexity. http://eccc.hpi-web.de/eccc-reports/2007/TR07-026/index.html.Google Scholar
- Moshkovitz, D. and Raz, R. 2008a. Sub-constant error low degree test of almost-linear size. SIAM J. Comput. 38, 1, 140--180. doi: 10.1137/060656838. Google Scholar
Digital Library
- Moshkovitz, D. and Raz, R. 2008b. Two query PCP with sub-constant error. In Proceedings of the 49th IEEE Symposium on Foundations of Computer Science (FOCS). IEEE, 314--323. doi: 10.1109/FOCS.2008.60. Google Scholar
Digital Library
- Parnas, M., Ron, D., and Rubinfeld, R. 2006. Tolerant property testing and distance approximation. J. Comput. Syst. Sci. 72, 6, 1012--1042. doi: 10.1016/j.jcss.2006.03.002. Google Scholar
Digital Library
- Polishchuk, A. and Spielman, D. A. 1994. Nearly-linear size holographic proofs. In Proceedings of the 26th ACM Symposium on Theory of Computing (STOC). ACM, 194--203. doi: 10.1145/195058.195132. Google Scholar
Digital Library
- Raz, R. 1998. A parallel repetition theorem. SIAM J. Comput. 27, 3, 763--803. doi: 10.1137/S0097539795280895. Google Scholar
Digital Library
- Samorodnitsky, A. and Trevisan, L. 2000. A PCP characterization of NP with optimal amortized query complexity. In Proceedings of the 32nd ACM Symposium on Theory of Computing (STOC). ACM, 191--199. doi: 10.1145/335305.335329. Google Scholar
Digital Library
- Samorodnitsky, A. and Trevisan, L. 2006. Gowers uniformity, influence of variables, and PCPs. In Proceedings of the 38th ACM Symposium on Theory of Computing (STOC). ACM, 11--20. doi: 10.1145/1132516.1132519. Google Scholar
Digital Library
- Szegedy, M. 1999. Many-valued logics and holographic proofs. In Proceedings of the 26th International Colloquium of Automata, Languages and Programming (ICALP), J. Wiedermann, P. van Emde Boas, and M. Nien, Eds. Lecture Notes in Computer Science, vol. 1644. Springer, 676--686. doi: 10.1007/3-540-48523-6. Google Scholar
Digital Library
- Trevisan, L. 2005. Approximation algorithms for unique games. In Proceedings of the 46th IEEE Symposium on Foundations of Computer Science (FOCS). IEEE, 197--205. doi: 10.1109/SFCS.2005.22. Google Scholar
Digital Library
- Woodruff, D. P. 2008. Corruption and recovery-efficient locally decodable codes. In Proceedings of the 12th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM), A. Goel, K. Jansen, J. D. P. Rolim, and R. Rubinfeld, Eds. Lecture Notes in Computer Science, vol. 5171. Springer, 584--595. doi: 10.1007/978-3-540-85363-3_46. Google Scholar
Digital Library
- Zwick, U. 1998. Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, 201--210. doi:10.1145/314613.314701. Google Scholar
Digital Library
Index Terms
Sound 3-Query PCPPs Are Long
Recommendations
Combinatorial PCPs with Efficient Verifiers
The PCP theorem asserts the existence of proofs that can be verified by a verifier that reads only a very small part of the proof. The theorem was originally proved by Arora and Safra (J. ACM 45(1)) and Arora et al. (J. ACM 45(3)) using sophisticated ...
Combinatorial PCPs with Efficient Verifiers
FOCS '09: Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer ScienceThe PCP theorem asserts the existence of proofs that can be verified by a verifier that reads only a very small part of the proof. The theorem was originally proved by Arora and Safra (J. ACM 45(1)) and Arora et al. (J. ACM 45(3)) using sophisticated ...
Sound 3-Query PCPPs Are Long
ICALP '08: Proceedings of the 35th international colloquium on Automata, Languages and Programming - Volume Part IWe initiate the study of the tradeoff between the lengthof a probabilistically checkable proof of proximity (PCPP) and the maximal soundnessthat can be guaranteed by a 3-query verifier with oracle access to the proof. Our main observation is that a ...






Comments