Some 3CNF properties are hard to test

Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova

Research output: Contribution to journalConference article

24 Citations (Scopus)

Abstract

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 [7]. 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 languageEnglish (US)
Pages (from-to)345-354
Number of pages10
JournalConference Proceedings of the Annual ACM Symposium on Theory of Computing
StatePublished - Aug 1 2003
Event35th Annual ACM Symposium on Theory of Computing - San Diego, CA, United States
Duration: Jun 9 2003Jun 11 2003

Fingerprint

Testing

All Science Journal Classification (ASJC) codes

  • Software

Cite this

Ben-Sasson, Eli ; Harsha, Prahladh ; Raskhodnikova, Sofya. / Some 3CNF properties are hard to test. In: Conference Proceedings of the Annual ACM Symposium on Theory of Computing. 2003 ; pp. 345-354.
@article{d05f29b78cd149059980bb42a09983c7,
title = "Some 3CNF properties are hard to test",
abstract = "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 [7]. 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.",
author = "Eli Ben-Sasson and Prahladh Harsha and Sofya Raskhodnikova",
year = "2003",
month = "8",
day = "1",
language = "English (US)",
pages = "345--354",
journal = "Conference Proceedings of the Annual ACM Symposium on Theory of Computing",
issn = "0734-9025",
publisher = "Association for Computing Machinery (ACM)",

}

Some 3CNF properties are hard to test. / Ben-Sasson, Eli; Harsha, Prahladh; Raskhodnikova, Sofya.

In: Conference Proceedings of the Annual ACM Symposium on Theory of Computing, 01.08.2003, p. 345-354.

Research output: Contribution to journalConference article

TY - JOUR

T1 - Some 3CNF properties are hard to test

AU - Ben-Sasson, Eli

AU - Harsha, Prahladh

AU - Raskhodnikova, Sofya

PY - 2003/8/1

Y1 - 2003/8/1

N2 - 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 [7]. 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.

AB - 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 [7]. 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.

UR - http://www.scopus.com/inward/record.url?scp=0038784646&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0038784646&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0038784646

SP - 345

EP - 354

JO - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

JF - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

SN - 0734-9025

ER -