Fast approximate PCPs

DOI10.1145/301250.301267zbMath1346.68097OpenAlexW2000179324MaRDI QIDQ2819532

Ravi Kumar, Ronitt Rubinfeld, Funda Ergün

Publication date: 29 September 2016

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

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

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (6)

On min-max \(r\)-gatherings ⋮ Short Locally Testable Codes and Proofs: A Survey in Two Parts ⋮ On Min-Max r-Gatherings ⋮ Clustering with lower-bounded sizes. A general graph-theoretic framework ⋮ Short Locally Testable Codes and Proofs ⋮ Spot-checkers

This page was built for publication: Fast approximate PCPs