## Abstract

For every integer k > 0, and an arbitrarily small constant ε > 0, we present a PCP characterization of NP where the verifier uses logarithmic randomness, non-adaptively queries 4k + k^{2} bits in the proof, accepts a correct proof with probability 1, i. e., it has perfect completeness, and accepts any supposed proof of a false statement with probability at most 2^{−} ^{k2} + ε. In particular, the verifier achieves optimal amortized query complexity of 1 + δ for arbitrarily small constant δ > 0. Such a characterization was already proved by Samorodnitsky and Trevisan (STOC 2000), but their verifier loses perfect completeness and their proof makes an essential use of this feature. By using an adaptive verifier, we can decrease the number of query bits to 2k + k^{2}, equal to the number obtained by Samorodnitsky and Trevisan. Finally we extend some of the results to PCPs over non-Boolean alphabets.

Original language | English (US) |
---|---|

Pages (from-to) | 119-148 |

Number of pages | 30 |

Journal | Theory of Computing |

Volume | 1 |

DOIs | |

State | Published - Sep 28 2005 |

## Keywords

- Amortized query bits
- Amortized query bits
- Approximation algorithms
- Computational complexity
- Inapproximability
- PCP
- Perfect completeness
- Probabilistically checkable proofs

## ASJC Scopus subject areas

- Theoretical Computer Science
- Computational Theory and Mathematics