PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability

This paper strengthens the low-error PCP characterization of NP, coming closer to the upper limit of the BGLR conjecture. Consider the task of verifying a witness for the membership of a given input in an NP language, using a constant number of accesses. We show that it is possible to achieve an error probability exponentially small in the number of bits accessed, where the number of bits in each access is as high as logβ

• Type: Conference
• Year: 1999
• Where: STOC
• Authors: Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra
• Keywords: Algorithms, Constant Number, Low-error Pcp Characterization, NP Language, STOC 1999