Unambiguous parity-query complexity
Computational Complexity
2024-01-23 v1
Abstract
We give a lower bound of 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 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.
Keywords
Cite
@article{arxiv.2401.11274,
title = {Unambiguous parity-query complexity},
author = {Dmytro Gavinsky},
journal= {arXiv preprint arXiv:2401.11274},
year = {2024}
}