scientific article; zbMATH DE number 6914957

DOI10.4086/cjtcs.2018.003zbMath1426.94159OpenAlexW4235411349MaRDI QIDQ4578332

Oded Goldreich, Tom Gur

Publication date: 8 August 2018

Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/cjtcs.2018.003

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

probabilistically checkable proofslocally testable codeslocally decodable codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (8)

A Hierarchy Theorem for Interactive Proofs of Proximity ⋮ Unnamed Item ⋮ A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification ⋮ An exponential separation between \textsf{MA} and \textsf{AM} proofs of proximity ⋮ Non-interactive proofs of proximity ⋮ Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP ⋮ On the Power of Relaxed Local Decoding Algorithms ⋮ Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity

This page was built for publication: