We develop a new technique for proving lower bounds in property testing, by showing a
strong connection between testing and communication complexity. We give a simple …

We present a new methodology for proving distribution testing lower bounds, establishing a
connection between distribution testing and the simultaneous message passing (SMP) …

We show how the communication complexity method introduced in (Blais, Brody, Matulef
2012) can be used to prove lower bounds on the number of queries required to test …

Adaptivity is known to play a crucial role in property testing. In particular, there exist
properties for which there is an exponential gap between the power of adaptive testing …

Correlation clustering is arguably the most natural formulation of clustering. Given n objects
and a pairwise similarity measure, the goal is to cluster the objects so that, to the best …

Ordered binary decision diagrams (OBDDs) are a popular data structure for Boolean
functions. One of its complexity measures is the width which has been investigated in …

A signed majority function is a linear threshold function f:+ 1,− 1 n→+ 1,− 1 of the form
f(x)=sign(i=1^nσ_ix_i) where each σ i∈+ 1,− 1. Signed majority functions are a highly …

Ordered binary decision diagrams (OBDDs) are a popular data structure for Boolean
functions. Some applications work with a restricted variant called complete OBDDs which is …

Property testing is concerned with deciding whether an object (eg a graph or a function) has
a certain property or is “far”(for some definition of far) from every object with that property. In …

Property testing is concerned with deciding whether an object (eg a graph or a function) has
a certain property or is “far”(for a prespecified distance measure) from every object with that …