A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Simple PCPs with poly-log rate and query complexity
2005
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing - STOC '05
We give constructions of probabilistically checkable proofs (PCPs) of length n·poly(log n) (to prove satisfiability of circuits of size n) that can verified by querying poly(log n) bits of the proof. We also give constructions of locally testable codes (LTCs) with similar parameters. Previous constructions of short PCPs (from [5] to [9]) relied extensively on properties of low degree multi-variate polynomials. In contrast, our constructions rely on new problems and techniques revolving around
doi:10.1145/1060590.1060631
dblp:conf/stoc/Ben-SassonS05
fatcat:o5wz74j6vzfc3o2jejt62adolm