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
0-1 Laws for Fragments of Existential Second-Order Logic: A Survey
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Probabilistic computations: Toward a unified measure of complexity
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
SIAM Journal on Computing
Property Testing: A Learning Theory Perspective
Foundations and Trends® in Machine Learning
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
Relational properties expressible with one universal quantifier are testable
SAGA'09 Proceedings of the 5th international conference on Stochastic algorithms: foundations and applications
Testing Boolean function isomorphism
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
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 |
Property testing is a kind of randomized approximation in which one takes a small, random sample of a structure and wishes to determine whether the structure satisfies some property or is far from satisfying the property.We focus on the testability of classes of first-order expressible properties, and in particular, on the classification of prefixvocabulary classes for testability. The main result is the untestability of [∀∃∀, (0, 1)]=. This is a well-known class and minimal for untestability. We discuss what is currently known about the classification for testability and briefly compare it to other classifications.