Combinatorial PCPs with Efficient Verifiers
From MaRDI portal
Publication:5171196
DOI10.1109/FOCS.2009.10zbMath1292.68078MaRDI QIDQ5171196
Publication date: 25 July 2014
Published in: 2009 50th Annual IEEE Symposium on Foundations of Computer Science (Search for Journal in Brave)
Related Items (8)
Derandomized parallel repetition via structured PCPs ⋮ Combinatorial PCPs with efficient verifiers ⋮ Shorter arithmetization of nondeterministic computations ⋮ Combinatorial algorithms for distributed graph coloring ⋮ Short Locally Testable Codes and Proofs: A Survey in Two Parts ⋮ Short Locally Testable Codes and Proofs ⋮ Combinatorial Algorithms for Distributed Graph Coloring ⋮ Combinatorial PCPs with short proofs
This page was built for publication: Combinatorial PCPs with Efficient Verifiers
