Highly Influential

# Small PCPs with low query complexity

@article{Harsha2000SmallPW, title={Small PCPs with low query complexity}, author={Prahladh Harsha and Madhu Sudan}, journal={computational complexity}, year={2000}, volume={9}, pages={157-201} }

- Published 2000 in computational complexity
DOI:10.1007/PL00001606

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… CONTINUE READING