Sciweavers

FOCS
1998
IEEE

A Tight Characterization of NP with 3 Query PCPs

14 years 3 months ago
A Tight Characterization of NP with 3 Query PCPs
It is known that there exists a PCP characterization of NP where the verifier makes 3 queries and has a onesided 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
Venkatesan Guruswami, Daniel Lewin, Madhu Sudan, L
Added 24 Aug 2010
Updated 24 Aug 2010
Type Conference
Year 1998
Where FOCS
Authors Venkatesan Guruswami, Daniel Lewin, Madhu Sudan, Luca Trevisan
Comments (0)