Robust pcps of proximity, shorter pcps and applications to coding

DOI10.1145/1007352.1007361zbMath1192.68286OpenAlexW1978478346MaRDI QIDQ3580954

Prahladh Harsha, Eli Ben-Sasson, Oded Goldreich, Madhu Sudan, Salil P. Vadhan

Publication date: 15 August 2010

Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1007352.1007361

Mathematics Subject Classification ID

Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Other types of codes (94B60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (6)

Succinct non-interactive arguments via linear interactive proofs ⋮ Interactive Oracle Proofs ⋮ Shorter arithmetization of nondeterministic computations ⋮ Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs ⋮ Testing algebraic geometric codes ⋮ Unnamed Item

This page was built for publication: Robust pcps of proximity, shorter pcps and applications to coding