Lower bounds for sampling algorithms for estimating the average
Information Processing Letters
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
Three theorems regarding testing graph properties
Random Structures & Algorithms
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
A Characterization of Easily Testable Induced Subgraphs
Combinatorics, Probability and Computing
On proximity oblivious testing
Proceedings of the forty-first annual ACM symposium on Theory of computing
Hierarchy Theorems for Property Testing
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Studies in complexity and cryptography
A nearly-quadratic gap between adaptive and non-adaptive property testers
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
| Hi-index | 0.00 |
Referring to the query complexity of testing graph properties in the adjacency matrix model, we advance the study of the class of properties that can be tested non-adaptively within complexity that is inversely proportional to the proximity parameter. Arguably, this is the lowest meaningful complexity class in this model, and we show that it contains a very natural class of graph properties. Specifically, for every fixed graph H, we consider the set of all graphs that are obtained by a (possibly unbalanced) blow-up of H. We show a non-adaptive tester of query complexity : Õ(1/ε) that distinguishes graphs that are a blow-up of H from graphs that are ε-far from any such blow-up.