Unambiguous parity-query complexity
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917572003233792 |
|---|---|
| author | Gavinsky, Dmytro |
| author_facet | Gavinsky, Dmytro |
| contents | We give a lower bound of $Ω(\sqrt n)$ on the unambiguous randomised parity-query complexity of the approximate majority problem -- that is, on the lowest randomised parity-query complexity of any function over $\{0,1\}^n$ whose value is "0" if the Hamming weight of the input is at most n/3, is "1" if the weight is at least 2n/3, and may be arbitrary otherwise. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_11274 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Unambiguous parity-query complexity Gavinsky, Dmytro Computational Complexity We give a lower bound of $Ω(\sqrt n)$ on the unambiguous randomised parity-query complexity of the approximate majority problem -- that is, on the lowest randomised parity-query complexity of any function over $\{0,1\}^n$ whose value is "0" if the Hamming weight of the input is at most n/3, is "1" if the weight is at least 2n/3, and may be arbitrary otherwise. |
| title | Unambiguous parity-query complexity |
| topic | Computational Complexity |
| url | https://arxiv.org/abs/2401.11274 |