A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Smooth and Strong PCPs
2020
Innovations in Theoretical Computer Science
Probabilistically checkable proofs (PCPs) can be verified based only on a constant amount of random queries, such that any correct claim has a proof that is always accepted, and incorrect claims are rejected with high probability (regardless of the given alleged proof). We consider two possible features of PCPs: A PCP is strong if it rejects an alleged proof of a correct claim with probability proportional to its distance from some correct proof of that claim. A PCP is smooth if each location
doi:10.4230/lipics.itcs.2020.2
dblp:conf/innovations/Paradise20
fatcat:2w4fsfevungyrpb2cc3yruf43y