abstract
the problem of testing monotonicity of a boolean function f : {0, 1}n → {0, 1} has received much attention
recently. denoting the proximity parameter by ε, the best tester is the
e √n/ε2 ) tester of khot-minzer-safra (focs 2015). let i(f ) denote the total
non-adaptive o(
influence of f . we give an adaptive tester whose running time is i(f )poly(ε−1 log n).