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

We describe two procedures which, given access to one copy of a quantum state and a
sequence of two-outcome measurements, can distinguish between the case that at least one …

A function f:{− 1, 1} n→{− 1, 1} is ak-junta if it depends on at most k of its variables. We
consider the problem of tolerant testing of k-juntas, where the testing algorithm must accept …

We prove tight bounds of Theta (k log k) queries for non-adaptively testing whether a
function f:{0, 1}^ n->{0, 1} is a k-parity or far from any k-parity. The lower bound combines a …

We give a new lower bound on the query complexity of any non-adaptive algorithm for
testing whether an unknown Boolean function is a k-junta versus epsilon-far from every k …

We consider two versions of the problem of testing graph isomorphism in the bounded-
degree graph model: A version in which one graph is fixed, and a version in which the input …

The framework of distribution testing is currently ubiquitous in the field of property testing. In
this model, the input is a probability distribution accessible via independently drawn …

Given a Boolean function f, the f-isomorphism testing problem requires a randomized
algorithm to distinguish functions that are identical to f up to relabeling of the input variables …

Given a Boolean function f, the f-isomorphism testing problem requires a randomized
algorithm to distinguish functions that are identical to f up to relabeling of the input variables …

The goal in the area of functions property testing is to determine whether a given black-box
Boolean function has a particular given property or is ε-far from having that property. We …