  In this paper, we consider the problem of tolerant junta testing for boolean
function. Compared with the prior work by Blais et al., we provide improved
results in terms of both the parameter gap and query complexity. Compared with
the prior work by De et al., our work did not close the parameter gap, but we
removed the $2^k$ term of the query complexity.

Data Structures and Algorithms;Computational Complexity