Sciweavers

Share
SIAMCOMP
2008

Short PCPs with Polylog Query Complexity

9 years 11 months ago
Short PCPs with Polylog Query Complexity
We give constructions of probabilistically checkable proofs (PCPs) of length n
Eli Ben-Sasson, Madhu Sudan
Added 14 Dec 2010
Updated 14 Dec 2010
Type Journal
Year 2008
Where SIAMCOMP
Authors Eli Ben-Sasson, Madhu Sudan
Comments (0)
books