Abstract
We study the query complexity of testing for properties defined by read-once formulas, as instances of massively parametrized properties, and prove several testability and nontestability results. First, we prove the testability of any property accepted by a Boolean read-once formula involving any bounded arity gates, with a number of queries exponential in ϵ, doubly exponential in the arity, and independent of all other parameters. When the gates are limited to being monotone, we prove that there is an estimation algorithm that outputs an approximation of the distance of the input from satisfying the property. For formulas only involving And/Or gates, we provide a more efficient test whose query complexity is only quasipolynomial in ϵ. On the other hand, we show that such testability results do not hold in general for formulas over non-Boolean alphabets. Specifically, we construct a property defined by a read-once arity 2 (non-Boolean) formula over an alphabet of size 4, such that any 1/4-test for it requires a number of queries depending on the formula size. We also present such a formula over an alphabet of size 5 that also satisfies a strong monotonicity condition.
- Noga Alon, Michael Krivelevich, Ilan Newman, and Mario Szegedy. 2000. Regular languages are testable with a constant number of queries. SIAM Journal on Computing 30, 6, 1842--1862. Google Scholar
Digital Library
- Eli Ben-Sasson, Prahladh Harsha, Oded Lachish, and Arie Matsliah. 2009. Sound 3-query PCPPs are long. ACM Transactions on Computation Theory 1, 2, 7:1--7:49. Google Scholar
Digital Library
- Eli Ben-Sasson, Prahladh Harsha, and Sofya Raskhodnikova. 2005. Some 3CNF properties are hard to test. SIAM Journal on Computing 35, 1, 1--21. Google Scholar
Digital Library
- Manuel Blum, Michael Luby, and Ronitt Rubinfeld. 1993. Self-testing/correcting with applications to numerical problems. Journal of Computer and System Sciences 47, 3, 549--595. Google Scholar
Digital Library
- Sourav Chakraborty, Eldar Fischer, Oded Lachish, Arie Matsliah, and Ilan Newman. 2007. Testing st -connectivity. In APPROX-RANDOM. 380--394. Google Scholar
Digital Library
- Eldar Fischer. 2004. The art of uninformed decisions: A primer to property testing. Current Trends in Theoretical Computer Science: The Challenge of the New Century I 229--264.Google Scholar
- Eldar Fischer, Oded Lachish, Ilan Newman, Arie Matsliah, and Orly Yahalom. 2012. On the query complexity of testing orientations for being Eulerian. ACM Transactions on Algorithms 8, 2, 1--41. Google Scholar
Digital Library
- Eldar Fischer, Ilan Newman, and Jiri Sgall. 2004. Functions that have read-twice constant width branching programs are not necessarily testable. Random Structures and Algorithms 24, 2, 175--193. Google Scholar
Digital Library
- Eldar Fischer and Orly Yahalom. 2011. Testing convexity properties of tree colorings. Algorithmica 60, 4 766--805.Google Scholar
Digital Library
- Oded Goldreich. 2010. A brief introduction to property testing. In Property Testing, Oded Goldreich (Ed.). Springer-, 1--5. Google Scholar
Digital Library
- Oded Goldreich, Shaffi Goldwasser, and Dana Ron. 1998. Property testing and its connection to learning and approximation. Journal of the ACM 45, 4, 653--750. Google Scholar
Digital Library
- Shirley Halevy, Oded Lachish, Ilan Newman, and Dekel Tsur. 2005. Testing orientation properties. In Electronic Colloquium on Computational Complexity (ECCC’05). 153.Google Scholar
- Shirley Halevy, Oded Lachish, Ilan Newman, and Dekel Tsur. 2007. Testing properties of constraint-graphs. In IEEE Conference on Computational Complexity. 264--277. Google Scholar
Digital Library
- Ilan Newman. 2002. Testing membership in languages that have small width branching programs. SIAM Journal on Computing 31, 5, 1557--1570. Google Scholar
Digital Library
- Ilan Newman. 2010. Property testing of massively parametrized problems—A survey. In Property Testing, Oded Goldreich (Ed.). Springer, 142--157. Google Scholar
Digital Library
- Dana Ron. 2008. Property testing: A learning theory perspective. Foundations and Trends in Machine Learning 1, 3, 307--402. Google Scholar
Digital Library
- Dana Ron. 2010. Algorithmic and analysis techniques in property testing. Journal Foundations and Trends<sup>®</sup> in Theoretical Computer Science 5, 2. Google Scholar
Digital Library
- Ronitt Rubinfeld and Madhu Sudan. 1996. Robust characterizations of polynomials with applications to program testing. SIAM Journal on Computing 25, 2, 252--271. Google Scholar
Digital Library
Index Terms
Testing Read-Once Formula Satisfaction
Recommendations
Testing formula satisfaction
SWAT'12: Proceedings of the 13th Scandinavian conference on Algorithm TheoryWe study the query complexity of testing for properties defined by read once formulae, as instances of massively parametrized properties, and prove several testability and non-testability results. First we prove the testability of any property accepted ...
Testing subgraphs in directed graphs
Special issue: STOC 2003Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least εn2 edges have to be deleted from it to make it H-free. We show that in this case G contains at least f(ε, H)nh copies of H. This is proved ...
Two-sided error proximity oblivious testing
The foregoing notion, introduced by Goldreich and Ron STOC 2009, was originally defined with respect to c = 1, which corresponds to one-sided error proximity-oblivious testing. Here we study the two-sided error version of proximity-oblivious testers; ...






Comments