#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2012

2016

- This year (0)
- Last 5 years (8)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Sourav Chakraborty, Eldar Fischer, Yonatan Goldhirsh, Arie Matsliah
- SIAM J. Comput.
- 2012

In this paper we define and examine the power of the <i>conditional sampling</i> oracle in the context of distribution-property testing. The conditional sampling oracle for a discrete distribution μ takes as input a subset S ⊂ [n] of the domain, and outputs a random sample i ∈ S drawn according to μ, conditioned on S (and independently… (More)

- Eldar Fischer, Yonatan Goldhirsh, Oded Lachish
- ITCS
- 2014

For a property <i>P</i> and a sub-property <i>P'</i>, we say that <i>P</i> is <i>P'</i>-partially testable with <i>q</i> queries} if there exists an algorithm that distinguishes, with high probability, inputs in <i>P'</i> from inputs ε-far from <i>P</i>, using <i>q</i> queries. Some natural properties require many queries to test, but can be… (More)

- Eldar Fischer, Yonatan Goldhirsh, Oded Lachish
- Electronic Colloquium on Computational Complexity
- 2013

For a property P and a sub-property P , we say that P is P -partially testable with q queries if there exists an algorithm that distinguishes, with high probability, inputs in P ′ from inputs ǫ-far from P by using q queries. There are natural properties that require many queries to test, but can be partitioned into a small number of subsets for which they… (More)

- Eldar Fischer, Yonatan Goldhirsh, Oded Lachish
- SWAT
- 2012

We study the query complexity of testing for properties defined by read once formulas, as instances of massively parametrized properties, and prove several testability and non-testability results. First we prove the testability of any property accepted by a Boolean read-once formula involving any bounded arity gates, with a number of queries exponential in… (More)

- Yonatan Goldhirsh, Michael Viderman
- APPROX-RANDOM
- 2013

- Eldar Fischer, Yonatan Goldhirsh, Oded Lachish
- TOCT
- 2016

We study the query complexity of testing for properties defined by read-once formulas, as instances of <i>massively parametrized properties</i>, and prove several testability and nontestability results. First, we prove the testability of any property accepted by a Boolean read-once formula involving any bounded arity gates, with a number of queries… (More)

We study the query complexity of testing for properties defined by read once formulas, as instances of massively parametrized properties, and prove several testability and non-testability results. First we prove the testability of any property accepted by a Boolean read-once formula involving any bounded arity gates, with a number of queries exponential in… (More)

1

- ‹
- 1
- ›