Abstract
We present a weaker variant of the PCP Theorem that admits a significantly easier proof. In this variant the prover only has n t time to compute each bit of his answer, for an arbitrary but fixed constant t, in contrast to being all powerful. We show that 3SAT is accepted by a polynomial-time probabilistic verifier that queries a constant number of bits from a polynomially long proof string. If a boolean formula ø of length n is satisfiable, then the verifier accepts with probability 1. If ø is not satisfiable, then the probability that a n t-bounded prover can fool the verifier is at most 1/2. The main technical tools used in the proof are the “easy” part of the PCP Theorem in which the verifier reads a constant number of bits from an exponentially long proof string, and the construction of a pseudo-random generator from a one-way permutation.KeywordsPCP Theoremsamplingcommunication complexity
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
