Abstract.
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In this paper we give a transformation with slightly-super-cubic blowup in proof size, with a low query complexity. Specifically, the verifier probes the proof in 16 bits and rejects every proof of a false assertion with probability arbitrarily close to 1/2, while accepting correct proofs of theorems with probability one. The proof is obtained by revisiting known constructions and improving numerous components therein. In the process we abstract a number of new modules that may be of use in other PCP constructions.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: November 7, 2000.
Rights and permissions
About this article
Cite this article
Harsha, P., Sudan, M. Small PCPs with low query complexity. Comput. complex. 9, 157–201 (2000). https://doi.org/10.1007/PL00001606
Issue Date:
DOI: https://doi.org/10.1007/PL00001606