Corpus ID: 18488985

Distance-Sensitive Property Testing Lower Bounds

  title={Distance-Sensitive Property Testing Lower Bounds},
  author={Joshua Brody and Pooya Hatami},
  journal={arXiv: Computational Complexity},
  • Joshua Brody, Pooya Hatami
  • Published 2013
  • Computer Science, Mathematics
  • arXiv: Computational Complexity
  • In this paper, we consider several property testing problems and ask how the query complexity depends on the distance parameter $\eps$. We achieve new lower bounds in this setting for the problems of testing whether a function is monotone and testing whether the function has low Fourier degree. For monotonicity testing, our lower bound matches the recent upper bound of Chakrabarty and Seshadhri. 

    Topics from this paper.


    Publications referenced by this paper.
    Monotonicity testing over general poset domains
    • 189
    • PDF
    Improved Testing Algorithms for Monotonicity
    • 156
    • PDF
    Lower Bounds for Testing Function Isomorphism
    • 35
    • PDF
    Testing juntas
    • 124
    • PDF
    Testing Monotonicity
    • 208
    • PDF
    Property Testing Lower Bounds via Communication Complexity
    • 52
    • Highly Influential
    The Probabilistic Communication Complexity of Set Intersection
    • 487
    Improved Bounds for Testing Juntas
    • E. Blais
    • Mathematics, Computer Science
    • 2008
    • 44
    • PDF
    On the Distributional Complexity of Disjointness
    • 478
    • PDF
    The Randomized Communication Complexity of Set Disjointness
    • 75
    • PDF