0-1 laws and decision problems for fragments of second-order logic
Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
Finite automata, formal logic, and circuit complexity
Finite automata, formal logic, and circuit complexity
Self-testing/correcting with applications to numerical problems
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
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
Regular Languages are Testable with a Constant Number of Queries
SIAM Journal on Computing
Testing the diameter of graphs
Random Structures & Algorithms
ω-Regular languages are testable with a constant number of queries
Theoretical Computer Science
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
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
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
Property testing in hypergraphs and the removal lemma
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Approximate Hypergraph Partitioning and Applications
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
A separation theorem in property testing
Combinatorica
Untestable properties in the kahr-moore-wang class
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
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
| Hi-index | 0.00 |
In property testing a small, random sample of an object is taken and one wishes to distinguish with high probability between the case where it has a desired property and the case where it is far from having the property. Much of the recent work has focused on graphs. In the present paper three generalized models for testing relational structures are introduced and relationships between these variations are shown. Furthermore, the logical classification problem for testability is considered and, as the main result, it is shown that Ackermann's class with equality is testable.