Ramsey theory (2nd ed.)
The algorithmic aspects of the regularity lemma
Journal of Algorithms
Random sampling and approximation of MAX-CSP problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Monotonicity testing over general poset domains
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
SIAM Journal on Discrete Mathematics
A Lower Bound for Testing 3-Colorability in Bounded-Degree Graphs
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Testing subgraphs in directed graphs
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Efficient Testing of Large Graphs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Regular Languages are Testable with a Constant Number of Queries
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Property testing and its connection to learning and approximation
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Testing Subgraphs in Large Graphs
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Three Theorems Regarding Testing Graph Properties
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Space Complexity Vs. Query Complexity
Computational Complexity
Property Testing: A Learning Theory Perspective
Foundations and Trends® in Machine Learning
On proximity oblivious testing
Proceedings of the forty-first annual ACM symposium on Theory of computing
Green's conjecture and testing linear-invariant properties
Proceedings of the forty-first annual ACM symposium on Theory of computing
Algorithmic Aspects of Property Testing in the Dense Graphs Model
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
Proceedings of the forty-second ACM symposium on Theory of computing
Introduction to testing graph properties
Property testing
Algorithmic aspects of property testing in the dense graphs model
Property testing
Introduction to testing graph properties
Property testing
Algorithmic aspects of property testing in the dense graphs model
Property testing
Studies in complexity and cryptography
Proximity oblivious testing and the role of invariances
Studies in complexity and cryptography
Introduction to testing graph properties
Studies in complexity and cryptography
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Inflatable graph properties and natural property tests
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Proximity oblivious testing and the role of invariances
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Testing Eulerianity and connectivity in directed sparse graphs
Theoretical Computer Science
Algorithmic Aspects of Property Testing in the Dense Graphs Model
SIAM Journal on Computing
On Proximity-Oblivious Testing
SIAM Journal on Computing
A nearly-quadratic gap between adaptive and non-adaptive property testers
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Nearly complete graphs decomposable into large induced matchings and their applications
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
SIAM Journal on Discrete Mathematics
Hi-index | 0.00 |
Let $H$ be a fixed graph on $h$ vertices. We say that a graph $G$ is induced $H$-free if it does not contain any induced copy of $H$. Let $G$ be a graph on $n$ vertices and suppose that at least $\epsilon n^2$ edges have to be added to or removed from it in order to make it induced $H$-free. It was shown in [5] that in this case $G$ contains at least $f(\epsilon,h)n^h$ induced copies of $H$, where $1/f(\epsilon,h)$ is an extremely fast growing function in $1/\epsilon$, that is independent of $n$. As a consequence, it follows that for every $H$, testing induced $H$-freeness with one-sided error has query complexity independent of $n$. A natural question, raised by the first author in [1], is to decide for which graphs $H$ the function $1/f(\epsilon,H)$ can be bounded from above by a polynomial in $1/\epsilon$. An equivalent question is: For which graphs $H$ can one design a one-sided error property tester for testing induced $H$-freeness, whose query complexity is polynomial in $1/\epsilon$? We settle this question almost completely by showing that, quite surprisingly, for any graph other than the paths of lengths 1,2 and 3, the cycle of length 4, and their complements, no such property tester exists. We further show that a similar result also applies to the case of directed graphs, thus answering a question raised by the authors in [9]. We finally show that the same results hold even in the case of two-sided error property testers. The proofs combine combinatorial, graph-theoretic and probabilistic arguments with results from additive number theory.