Adaptive Boolean Monotonicity Testing in Total Influence Time
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 non-adaptive O(n/2) tester of Khot-Minzer-Safra (FOCS 2015). Let I(f) denote the total influence of f. We give an adaptive tester whose running time is I(f)poly(-1 n).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.