Self-testing/correcting for polynomials and for approximate functions
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Self-testing/correcting with applications to numerical problems
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Testing graphs for colorable properties
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Monotonicity testing over general poset domains
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
Regular Languages are Testable with a Constant Number of Queries
SIAM Journal on Computing
Testing Membership in Languages that Have Small Width Branching Programs
SIAM Journal on Computing
Fast Approximate PCPs for Multidimensional Bin-Packing Problems
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
Improved Testing Algorithms for Monotonicity
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
Some 3CNF properties are hard to test
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Functions that have Read-Twice Constant Width Branching Programs are not Necessarily Testable
CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
On the strength of comparisons in property testing
Information and Computation
Every monotone graph property is testable
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A large lower bound on the query complexity of a simple boolean function
Information Processing Letters
A Characterization of the (natural) Graph Properties Testable with One-Sided Error
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A combinatorial characterization of the testable graph properties: it's all about regularity
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Space Complexity Vs. Query Complexity
Computational Complexity
Property Testing: A Learning Theory Perspective
Foundations and Trends® in Machine Learning
A large lower bound on the query complexity of a simple boolean function
Information Processing Letters
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
Nearly tight bounds for testing function isomorphism
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Property testing and the branching program size of boolean functions
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Space complexity vs. query complexity
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
| Hi-index | 0.00 |
We construct a property on 0/1-strings that has a representation by a collection of width-3 read-twice oblivious branching programs, but for which any two-sided ε-testing algorithm must query at least Ω(nδ) many queries for some fixed ε and δ. This shows that Newman's result [Testing of functions that have small width branching programs, SIAM J Comput 31 (2002), 1557-1570] cannot be generalized to read-k-times functions for k 1. In addition, we exhibit a property that has also a representation by a CNF formula of constant clause size. Hence, the nontestability results extend to properties that in addition have small (constant size) 0-witnesses.