A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is
PCP characterizations of NP
Proceedings of the thirty-first annual ACM symposium on Theory of computing - STOC '99
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 β n , for any constant β < 1. The BGLR conjecture asserts the same for adoi:10.1145/301250.301265 dblp:conf/stoc/DinurFKRS99 fatcat:3k5mbmftane7zaeesdc7slsoki