Self-testing/correcting with applications to numerical problems
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
Testing subgraphs in large graphs
Random Structures & Algorithms - Special issue: Proceedings of the tenth international conference "Random structures and algorithms"
Three theorems regarding testing graph properties
Random Structures & Algorithms
Testing subgraphs in directed graphs
Journal of Computer and System Sciences - Special issue: STOC 2003
Regularity lemma for k-uniform hypergraphs
Random Structures & Algorithms
Linear equations, arithmetic progressions and hypergraph property testing
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
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
The counting lemma for regular k-uniform hypergraphs
Random Structures & Algorithms
| Hi-index | 0.00 |
We investigate the property of k-uniform k-partite (directed) hypergraphs with colored edges of being free of a fixed family of forbidden induced substructures. We show that this property is not testable with a number of queries polynomial in 1/茂戮驴, presenting proofs for the case of two colors and k= 3, as well as the case of three colors and k= 2 (edge-colored bipartite graphs). This settles an open question from [1], implying that the polynomial testability proof for two colors and k= 2 cannot be extended to these structures.