Property testing and its connection to learning and approximation
- 24 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 339-348
- https://doi.org/10.1109/sfcs.1996.548493
Abstract
No abstract availableThis publication has 32 references indexed in Scilit:
- Robust Characterizations of Polynomials with Applications to Program TestingSIAM Journal on Computing, 1996
- Probably almost discriminative learningMachine Learning, 1995
- The hardness of approximation: Gap locationcomputational complexity, 1994
- The minimum consistent DFA problem cannot be approximated within any polynomialJournal of the ACM, 1993
- Efficient probabilistically checkable proofs and applications to approximationsPublished by Association for Computing Machinery (ACM) ,1993
- Computational limitations on learning from examplesJournal of the ACM, 1988
- A theory of the learnableCommunications of the ACM, 1984
- On recognizing graph properties from adjacency matricesTheoretical Computer Science, 1976
- On the time required to recognize properties of graphsACM SIGACT News, 1973
- On the Uniform Convergence of Relative Frequencies of Events to Their ProbabilitiesTheory of Probability and Its Applications, 1971