Small PCPs with low query complexity
From MaRDI portal
Publication:5946703
DOI10.1007/PL00001606zbMath0986.68134OpenAlexW2128057004MaRDI QIDQ5946703
Publication date: 14 October 2001
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00001606
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (9)
Succinct non-interactive arguments via linear interactive proofs ⋮ Interactive Oracle Proofs ⋮ Linear-size constant-query IOPs for delegating computation ⋮ Shorter arithmetization of nondeterministic computations ⋮ Short Locally Testable Codes and Proofs: A Survey in Two Parts ⋮ Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs ⋮ Short Locally Testable Codes and Proofs ⋮ Unnamed Item ⋮ Computational Integrity with a Public Random String from Quasi-Linear PCPs
This page was built for publication: Small PCPs with low query complexity
