A Lower Bound on the Complexity of Testing Grained Distributions

Oded Goldreich*, Dana Ron

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

For a natural number m , a distribution is called m -grained, if each element appears with probability that is an integer multiple of 1 / m . We prove that, for any constant c< 1 , testing whether a distribution over [Θ (m)] is m -grained requires Ω (mc) samples, where testing a property of distributions means distinguishing between distributions that have the property and distributions that are far (in total variation distance) from any distribution that has the property.

Original languageEnglish
Article number11
JournalComputational Complexity
Volume32
Issue number2
DOIs
StatePublished - Dec 2023

Funding

FundersFunder number
European Commission
Israel Science Foundation1041/18
Horizon 2020819702

    Keywords

    • 68Q25
    • Property testing
    • distributions

    Fingerprint

    Dive into the research topics of 'A Lower Bound on the Complexity of Testing Grained Distributions'. Together they form a unique fingerprint.

    Cite this