Boolean function monotonicity testing requires (almost) $n^{1/2}$ queries
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866917066927243264 |
|---|---|
| author | Chen, Mark Chen, Xi Cui, Hao Pires, William Stockwell, Jonah |
| author_facet | Chen, Mark Chen, Xi Cui, Hao Pires, William Stockwell, Jonah |
| contents | We show that for any constant $c>0$, any (two-sided error) adaptive algorithm for testing monotonicity of Boolean functions must have query complexity $Ω(n^{1/2-c})$. This improves the $\tildeΩ(n^{1/3})$ lower bound of [CWX17] and almost matches the $\tilde{O}(\sqrt{n})$ upper bound of [KMS18]. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_04558 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Boolean function monotonicity testing requires (almost) $n^{1/2}$ queries Chen, Mark Chen, Xi Cui, Hao Pires, William Stockwell, Jonah Computational Complexity Discrete Mathematics Data Structures and Algorithms We show that for any constant $c>0$, any (two-sided error) adaptive algorithm for testing monotonicity of Boolean functions must have query complexity $Ω(n^{1/2-c})$. This improves the $\tildeΩ(n^{1/3})$ lower bound of [CWX17] and almost matches the $\tilde{O}(\sqrt{n})$ upper bound of [KMS18]. |
| title | Boolean function monotonicity testing requires (almost) $n^{1/2}$ queries |
| topic | Computational Complexity Discrete Mathematics Data Structures and Algorithms |
| url | https://arxiv.org/abs/2511.04558 |