Name
Abstract | ||
|---|---|---|
We show a construction of a PCP with both sub-constant error and almost-linear size. Specifically, for some constant 0 PCP verifier for checking satisfiability of Boolean formulas that on input of size n uses $$\log\, n+O((\log\, n)^{1-\alpha})$$random bits to make 7 queries to a proof of size $$n·2^{O((\log\, n)^{1-\alpha})}$$, where each query is answered by $$O((\log\, n)^{1-\alpha})$$bit long string, and the verifier has perfect completeness and error $$2^{-\Omega((\log\, n)^{\alpha})}$$. The construction is by a new randomness-efficient version of the aggregation through curves technique. Its main ingredients are a recent low degree test with both sub-constant error and almost-linear size and a new method for constructing a short list of balanced curves. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/s00037-009-0278-0 | Computational Complexity |
Keywords | DocType | Volume |
new randomness-efficient version,balanced curve,. probabilistically checkable proof pcp,boolean formula,long string,pcp verifier,almost-linear size,sub-constant error probabilistically checkable,new method,curves technique,size n,balanced curves subject classification. 68q17.,sub-constant error,satisfiability | Journal | 19 |
Issue | ISSN | Citations |
3 | 1420-8954 | 8 |
PageRank | References | Authors |
0.51 | 17 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dana Moshkovitz | 1 | 368 | 19.14 |
| Ran Raz | 2 | 2772 | 180.87 |