A PCP characterization of NP with optimal amortized query complexity

@inproceedings{Samorodnitsky2000APC,
  title={A PCP characterization of NP with optimal amortized query complexity},
  author={Alex Samorodnitsky and Luca Trevisan},
  booktitle={STOC},
  year={2000}
}
For every e > 0 and integers k and q (with k < q <_ k+k2/4), we present a P C P character iza t ion of NP, where the verifier queries q bits (of which only k are free bits), accepts a correct proof wi th probabi l i ty >__ 1 e and accepts a "proof" of a wrong s t a t emen t wi th probabi l i ty ~ 2 (q-k) . In par t icular , for every 6 > 0 we have a P C P character izat ion of NP, where the verifier has, s imultaneously, 1 + 5 amor t ized query complexi ty and 6 amor t ized free bit complexity… CONTINUE READING
Highly Influential
This paper has highly influenced 26 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 194 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 123 extracted citations

On the derandomization of the graph test for homomorphism over groups

Theor. Comput. Sci. • 2011
View 10 Excerpts
Highly Influenced

Guest column: inapproximability results via Long Code based PCPs

SIGACT News • 2005
View 8 Excerpts
Highly Influenced

On the Approximation Resistance of a Random Predicate

computational complexity • 2009
View 5 Excerpts
Highly Influenced

On The Hardness of Approximating Max-Satisfy

Electronic Colloquium on Computational Complexity • 2004
View 5 Excerpts
Highly Influenced

Simple Analysis of Graph Tests for Linearity and PCP

IEEE Conference on Computational Complexity • 2001
View 11 Excerpts
Highly Influenced

194 Citations

0102030'99'03'08'13'18
Citations per Year
Semantic Scholar estimates that this publication has 194 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Free bits

M. Bellare, O. Goldreich, M. Sudan
PCP ' s and non-approximabil i ty - towards t ight results. SIAM Journal on Computing, 27(3):804-915 • 1998
View 3 Excerpts
Highly Influenced

Selftest ing/correct ing with applications to numerical problems

M. Blum, M. Luby, R. Rubinfeld
Proceedings of the 22nd A CM Symposium on Theory of Computing, pages 73-83, 1990. [14] [15] [16] [17] [18] [19] [20] [211 N. Creignou. A dichotomy theorem for maximum generalized satisfiability problems. Journal of Computer and System Sciences, 51 • 1997
View 3 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…