毫不含糊的奇偶校验查询复杂度

Electron. Colloquium Comput. Complex. Pub Date : 2024-01-20 DOI:10.48550/arXiv.2401.11274

Dmytro Gavinsky

{"title":"毫不含糊的奇偶校验查询复杂度","authors":"Dmytro Gavinsky","doi":"10.48550/arXiv.2401.11274","DOIUrl":null,"url":null,"abstract":"We 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.","PeriodicalId":11639,"journal":{"name":"Electron. Colloquium Comput. Complex.","volume":"46 3","pages":"TR24-009"},"PeriodicalIF":0.0000,"publicationDate":"2024-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Unambiguous parity-query complexity\",\"authors\":\"Dmytro Gavinsky\",\"doi\":\"10.48550/arXiv.2401.11274\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We 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.\",\"PeriodicalId\":11639,\"journal\":{\"name\":\"Electron. Colloquium Comput. Complex.\",\"volume\":\"46 3\",\"pages\":\"TR24-009\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-01-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electron. Colloquium Comput. Complex.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.48550/arXiv.2401.11274\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electron. Colloquium Comput. Complex.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48550/arXiv.2401.11274","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

我们给出了近似多数问题的无歧义随机奇偶校验查询复杂度的$\Omega(\sqrt n)$下限--也就是说，在${0,1\}^n$上的任何函数的最低随机奇偶校验查询复杂度，如果输入的汉明权重最多为 n/3，则其值为 "0"，如果权重至少为 2n/3，则其值为 "1"，否则可以是任意值。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Unambiguous parity-query complexity

We 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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Electron. Colloquium Comput. Complex.

自引率

0.00%

发文量