Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
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
On a monadic NP vs monadic co-NP
Information and Computation
A First-Order Isomorphism Theorem
SIAM Journal on Computing
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
Three theorems regarding testing graph properties
Random Structures & Algorithms
ω-Regular languages are testable with a constant number of queries
Theoretical Computer Science
Testing graphs for colorability properties
Random Structures & Algorithms
Design and Analysis of Randomized Algorithms: Introduction to Design Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
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
| Hi-index | 0.00 |
The "richness" of properties that are indistinguishable from first-order properties is investigated. Indistinguishability is a concept of equivalence among properties of combinatorial structures that is appropriate in the context of testability. All formulas in a restricted class of second-order logic are shown to be indistinguishable from first-order formulas. Arbitrarily hard properties, including RE-complete properties, that are indistinguishable from first-order formulas are shown to exist. Implications on the search for a logical characterization of the testable properties are discussed.