A Polynomial Lower Bound for Testing Monotonicity

STOC, pp. 1021-1032, 2016.

Cited by: 42|Bibtex|Views5|Links
EI
Keywords:
Property TestingAdaptivity of query algorithmsTalagrand's Random DNF

Abstract:

We show that every algorithm for testing n-variate Boolean functions for monotonicityhas query complexity Ω(n1/4). All previous lower bounds for this problem were designed for non-adaptive algorithms and, as a result, the best previous lower bound for general (possibly adaptive) monotonicity testers was only Ω(logn). Combined with the que...More

Code:

Data:

Your rating :
0

 

Tags
Comments