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
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
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
Functions that have read-twice constant width branching programs are not necessarily testable
Random Structures & Algorithms
Some 3CNF Properties Are Hard to Test
SIAM Journal on Computing
Testing Properties of Constraint-Graphs
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Property Testing: A Learning Theory Perspective
Foundations and Trends® in Machine Learning
ACM Transactions on Computation Theory (TOCT)
Algorithmic and Analysis Techniques in Property Testing
Algorithmic and Analysis Techniques in Property Testing
A brief introduction to property testing
Property testing
Property testing of massively parametrized problems – a survey
Property testing
Testing Convexity Properties of Tree Colorings
Algorithmica
On the query complexity of testing orientations for being Eulerian
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
We 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 by a Boolean read-once formula involving any bounded arity gates, with a number of queries exponential in ε 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 formulae 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 formulae over non-Boolean alphabets; specifically we construct a property defined by a read-once arity 2 (non-Boolean) formula over alphabets of size 4, such that any 1/4-test for it requires a number of queries depending on the formula size.