Roei Tell

Learn More
A few years ago, Blais, Brody, and Matulef (2012) presented a methodology for proving lower bounds for property testing problems by reducing them from problems in communication complexity. Recently, Bhrushundi, Chakraborty, and Kulkarni (2014) showed that some reductions of this type can be deconstructed to two separate reductions, from communication(More)
We consider the following problem. A deterministic algorithm tries to find a string in an unknown set S ⊆ {0, 1} n that is guaranteed to have large density (e.g., |S| ≥ 2 n−1). However, the only information that the algorithm can obtain about S is estimates of the density of S in adaptively chosen subsets of {0, 1} n , where the estimates are up to a(More)
This work studies a new type of problems in property testing, called <i>dual problems</i>. For a set &#938; in a metric space and &#948; &#62; 0, denote by <b>F</b><sub>&#948;</sub>(&#938;) the set of elements that are &#948;-far from &#938;. Then, in property testing, a &#948;tester for &#960; is required to accept inputs from &#938; and reject inputs from(More)
  • 1