Near-Optimal Algorithm for Distribution-Free Junta Testing
share
In this paper, We firstly present an algorithm for the problem of distribution-free junta testing for Boolean functions with one-sided error, the query complexity of which is Õ(k/ϵ). This closes the gap between upper bound and lower bound of the query complexity. Further, we present a simpler algorithm with the same query complexity.
READ FULL TEXT
