Adaptive Boolean Monotonicity Testing in Total Influence Time
Data Structures and Algorithms
2018-01-10 v1 Computational Complexity
Discrete Mathematics
Abstract
The problem of testing monotonicity of a Boolean function has received much attention recently. Denoting the proximity parameter by , the best tester is the non-adaptive tester of Khot-Minzer-Safra (FOCS 2015). Let denote the total influence of . We give an adaptive tester whose running time is .
Cite
@article{arxiv.1801.02816,
title = {Adaptive Boolean Monotonicity Testing in Total Influence Time},
author = {Deeparnab Chakrabarty and C. Seshadhri},
journal= {arXiv preprint arXiv:1801.02816},
year = {2018}
}