Boolean function monotonicity testing requires (almost) $n^{1/2}$ queries
Computational Complexity
2025-11-10 v2 Discrete Mathematics
Data Structures and Algorithms
Abstract
We show that for any constant , any (two-sided error) adaptive algorithm for testing monotonicity of Boolean functions must have query complexity . This improves the lower bound of [CWX17] and almost matches the upper bound of [KMS18].
Keywords
Cite
@article{arxiv.2511.04558,
title = {Boolean function monotonicity testing requires (almost) $n^{1/2}$ queries},
author = {Mark Chen and Xi Chen and Hao Cui and William Pires and Jonah Stockwell},
journal= {arXiv preprint arXiv:2511.04558},
year = {2025}
}