Simple PCPs with poly-log rate and query complexity
From MaRDI portal
Publication:3581427
DOI10.1145/1060590.1060631zbMath1192.68287OpenAlexW2034154168MaRDI QIDQ3581427
Publication date: 16 August 2010
Published in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1060590.1060631
Related Items (11)
Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) ⋮ Symmetric LDPC codes and local testing ⋮ Symmetric LDPC Codes and Local Testing ⋮ Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP ⋮ Limits on the Rate of Locally Testable Affine-Invariant Codes ⋮ Dense Locally Testable Codes Cannot Have Constant Rate and Distance ⋮ Bravely, Moderately: A Common Theme in Four Recent Works ⋮ A combinatorial characterization of smooth LTCs and applications ⋮ Testing algebraic geometric codes ⋮ On Dinur’s proof of the PCP theorem ⋮ Spartan: efficient and general-purpose zkSNARKs without trusted setup
This page was built for publication: Simple PCPs with poly-log rate and query complexity
