Every minor-closed property of sparse graphs is testable
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Relational properties expressible with one universal quantifier are testable
SAGA'09 Proceedings of the 5th international conference on Stochastic algorithms: foundations and applications
Introduction to testing graph properties
Property testing
Introduction to testing graph properties
Property testing
Introduction to testing graph properties
Studies in complexity and cryptography
Contemplations on testing graph properties
Studies in complexity and cryptography
A note on the testability of ramsey's class
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Untestable properties expressible with four first-order quantifiers
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Testable and untestable classes of first-order formulae
Journal of Computer and System Sciences
| Hi-index | 0.00 |