Sub-Constant Error Probabilistically Checkable Proof of Almost-Linear Size

• Published 2007 in computational complexity

Abstract

We show a construction of a PCP with both sub-constant error and almost-linear size. Specifically, for some constant 0 < α < 1, we construct a 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… (More)
DOI: 10.1007/s00037-009-0278-0

Cite this paper

@article{Moshkovitz2007SubConstantEP, title={Sub-Constant Error Probabilistically Checkable Proof of Almost-Linear Size}, author={Dana Moshkovitz and Ran Raz}, journal={computational complexity}, year={2007}, volume={19}, pages={367-422} }