Property testing and its connection to learning and approximation

This publication has 31 references indexed in Scilit:

• A General Classification Rule for Probability Measures
  The Annals of Statistics, 1995
• The hardness of approximation: Gap location
  computational complexity, 1994
• The Algorithmic Aspects of the Regularity Lemma
  Journal of Algorithms, 1994
• Self-testing/correcting with applications to numerical problems
  Journal of Computer and System Sciences, 1993
• Simple Constructions of Almost k‐wise Independent Random Variables
  Random Structures & Algorithms, 1992
• An ?(n 4/3) lower bound on the randomized complexity of graph properties
  Combinatorica, 1991
• Non-deterministic exponential time has two-prover interactive protocols
  computational complexity, 1991
• An ?(n 5/4) lower bound on the randomized complexity of graph properties
  Combinatorica, 1991
• On the time required to recognize properties of graphs
  ACM SIGACT News, 1973
• On Determining the Irrationality of the Mean of a Random Variable
  The Annals of Statistics, 1973