ECCC-Report TR24-009https://eccc.weizmann.ac.il/report/2024/009Comments and Revisions published for TR24-009en-usSun, 21 Jan 2024 14:59:00 +0200
Comment 1
| Unambiguous parity-query complexity |
Dmytro Gavinsky
https://eccc.weizmann.ac.il/report/2024/009#comment1We give a lower bound of $\Omega(\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.Sun, 21 Jan 2024 14:59:00 +0200https://eccc.weizmann.ac.il/report/2024/009#comment1
Paper TR24-009
| Unambiguous parity-query complexity |
Dmytro Gavinsky
https://eccc.weizmann.ac.il/report/2024/009We give a lower bound of ?(?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}? 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.Sun, 21 Jan 2024 12:51:21 +0200https://eccc.weizmann.ac.il/report/2024/009