Testing problems with sub-learning sample complexity
- 24 July 1998
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 268-279
- https://doi.org/10.1145/279943.279996
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- On the Robustness of Functional EquationsSIAM Journal on Computing, 1999
- A sublinear bipartiteness tester for bounded degree graphsPublished by Association for Computing Machinery (ACM) ,1998
- Property testing in bounded degree graphsPublished by Association for Computing Machinery (ACM) ,1997
- Robust Characterizations of Polynomials with Applications to Program TestingSIAM Journal on Computing, 1996
- Probably Almost Discriminative LearningMachine Learning, 1995
- Learning Boolean formulasJournal of the ACM, 1994
- Self-testing/correcting with applications to numerical problemsJournal of Computer and System Sciences, 1993
- On probably correct classification of conceptsPublished by Association for Computing Machinery (ACM) ,1993
- Introduction to Statistical InferencePublished by Springer Nature ,1987
- Probabilistic encryptionJournal of Computer and System Sciences, 1984