For a boolean formula ψ on n variables, the associated property Pψ is the collection of n-bit strings that satisfy ψ. We prove that there are 3CNF properties that require a linear number of queries, even for adaptive tests. This contrasts with 2CNF properties that are testable with O(√n) queries . Notice that for every bad instance (i.e. an assignment that does not satisfy ψ) there is a 3-bit query that witnesses this fact. Nevertheless, finding such a short witness requires a linear number of queries, even for assignments that are very far from satisfying. We provide sufficient conditions for linear properties to be hard to test, and in the course of the proof include a couple of observations which are of independent interest. 1. In the context of linear property testing, adaptive 2-sided error tests have no more power than non-adaptive 1-sided error tests. 2. Random linear LDPC codes with linear distance and constant rate are very far from being locally testable.
|Original language||English (US)|
|Number of pages||10|
|Journal||Conference Proceedings of the Annual ACM Symposium on Theory of Computing|
|State||Published - 2003|
|Event||35th Annual ACM Symposium on Theory of Computing - San Diego, CA, United States|
Duration: Jun 9 2003 → Jun 11 2003
All Science Journal Classification (ASJC) codes