https://scigraph.springernature.com/explorer/license/
2000-12
probability one
high query complexity
checkable proofs
proof
module
components
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.
theorem
query complexity
new module
large polynomials
2000-12-01
true
en
PCP
PCP constructions
article
false assertions
low query complexity
Small PCPs with low query complexity
correct proof
https://doi.org/10.1007/pl00001606
numerous components
use
construction
known constructions
number
157-201
proof size
2022-05-20T07:21
polynomials
assertion
complexity
process
verifier
transformation
size
probability
blowup
paper
articles
bits
one
9
Laboratory for Computer Science, Massachusetts Institute of Technology, 545 Technology Square, Cambridge, MA 02139, U.S.A., e-mail: prahladh@mit.edu, US
Laboratory for Computer Science, Massachusetts Institute of Technology, 545 Technology Square, Cambridge, MA 02139, U.S.A., e-mail: madhu@mit.edu, http://theory.lcs.mit.edu/~madhu/, US
Laboratory for Computer Science, Massachusetts Institute of Technology, 545 Technology Square, Cambridge, MA 02139, U.S.A., e-mail: prahladh@mit.edu, US
Laboratory for Computer Science, Massachusetts Institute of Technology, 545 Technology Square, Cambridge, MA 02139, U.S.A., e-mail: madhu@mit.edu, http://theory.lcs.mit.edu/~madhu/, US
Computation Theory and Mathematics
computational complexity
1420-8954
Springer Nature
1016-3328
Sudan
M.
P.
Harsha
Information and Computing Sciences
pub.1025900372
dimensions_id
3
Springer Nature - SN SciGraph project
10.1007/pl00001606
doi