2 search results - page 1 / 1 » Assignment Testers: Towards a Combinatorial Proof of the PCP... |
FOCS
2004
IEEE
13 years 8 months ago
2004
IEEE
In this work we look back into the proof of the PCP Theorem, with the goal of finding new proofs that are "more combinatorial" and arguably simpler. For that we introduc...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...