Property testing algorithms are ultra"-efficient algorithms that decide whether a given object (e.g., a graph) has a certain property (e.g., bipartiteness), or

This book introduces important results and techniques in property testing, where the goal is to design algorithms that decide whether their input satisfies a pr

Property Testing is the study of super-fast algorithms for approximate decision making. This volume features work presented at a mini-workshop on property testi

Property testing is concerned with the design of super-fast algorithms for the structural analysis of large quantities of data. The aim is to unveil global feat

This survey focuses on results for testing properties of functions that are of interest to the learning theory community.