Sciweavers

67
Voted
FOCS
2008
IEEE
15 years 3 months ago
Two Query PCP with Sub-Constant Error
We show that the NP-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 ver...
Dana Moshkovitz, Ran Raz