A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
A tight characterization of NP with 3 query PCPs
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
It is known that there exists a PCP characterization of NP where the verifier makes 3 queries and has a one-sided error that is bounded away from 1; and also that 2 queries do not suffice for such a characterization. Thus PCPs with 3 queries possess non-trivial verification power and motivate the task of determining the lowest error that can be achieved with a 3-query PCP. Recently, Håstad [11] has shown a tight characterization of NP by constructing a 3-query PCP verifier with "error"
doi:10.1109/sfcs.1998.743424
dblp:conf/focs/GuruswamiLST98
fatcat:orzc7bj76bbyxlw7a25kro2n44