The decision problem for the probabilities of higher-order properties
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Testing graphs for colorable properties
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Testing graphs for colorability properties
Random Structures & Algorithms
Property testing in hypergraphs and the removal lemma
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
A Characterization of the (Natural) Graph Properties Testable with One-Sided Error
SIAM Journal on Computing
A separation theorem in property testing
Combinatorica
Relational properties expressible with one universal quantifier are testable
SAGA'09 Proceedings of the 5th international conference on Stochastic algorithms: foundations and applications
Testability and repair of hereditary hypergraph properties
Random Structures & Algorithms
Untestable properties in the kahr-moore-wang class
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
| Hi-index | 0.00 |
In property testing, the goal is to distinguish between objects that satisfy some desirable property and objects that are far from satisfying it, after examining only a small, random sample of the object in question Although much of the literature has focused on properties of graphs, very recently several strong results on hypergraphs have appeared We revisit a logical result obtained by Alon et al. [1] in the light of these recent results The main result is the testability of all properties (of relational structures) expressible in sentences of Ramsey's class.