A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Two Query PCP with Sub-Constant Error
2008
2008 49th Annual IEEE Symposium on Foundations of Computer Science
We show that the N P-Complete language 3SAT has a PCP verifier that makes two queries to a proof of almost-linear size and achieves sub-constant probability of error o(1). The verifier performs only projection tests, meaning that the answer to the first query determines at most one accepting answer to the second query. Previously, by the parallel repetition theorem, there were PCP Theorems with two-query projection tests, but only (arbitrarily small) constant error and polynomial size [29] .
doi:10.1109/focs.2008.60
dblp:conf/focs/MoshkovitzR08
fatcat:agpggrno5ncuxnvr4vimozvvfy