Some 3CNF properties are hard to test
From MaRDI portal
Publication:3581273
DOI10.1145/780542.780594zbMath1192.68347OpenAlexW2066465093MaRDI QIDQ3581273
Sofya Raskhodnikova, Eli Ben-Sasson, Prahladh Harsha
Publication date: 16 August 2010
Published in: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/780542.780594
Related Items (6)
Short Locally Testable Codes and Proofs: A Survey in Two Parts ⋮ Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP ⋮ Short Locally Testable Codes and Proofs ⋮ Robust locally testable codes and products of codes ⋮ A large lower bound on the query complexity of a simple Boolean function ⋮ Testing algebraic geometric codes
This page was built for publication: Some 3CNF properties are hard to test