不连接下多方通信复杂度的简化下界

Cybersecurity and Cyberforensics Conference Pub Date : 2015-06-17 DOI:10.4230/LIPIcs.CCC.2015.88

Anup Rao, A. Yehudayoff

{"title":"不连接下多方通信复杂度的简化下界","authors":"Anup Rao, A. Yehudayoff","doi":"10.4230/LIPIcs.CCC.2015.88","DOIUrl":null,"url":null,"abstract":"We show that the deterministic number-on-forehead communication complexity of set disjointness for k parties on a universe of size n is Ω(n/ 4k). This gives the first lower bound that is linear in n, nearly matching Grolmusz's upper bound of O(log2(n) + k2n/2k). We also simplify the proof of Sherstov's [EQUATION] lower bound for the randomized communication complexity of set disjointness.","PeriodicalId":246506,"journal":{"name":"Cybersecurity and Cyberforensics Conference","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"30","resultStr":"{\"title\":\"Simplified Lower Bounds on the Multiparty Communication Complexity of Disjointness\",\"authors\":\"Anup Rao, A. Yehudayoff\",\"doi\":\"10.4230/LIPIcs.CCC.2015.88\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We show that the deterministic number-on-forehead communication complexity of set disjointness for k parties on a universe of size n is Ω(n/ 4k). This gives the first lower bound that is linear in n, nearly matching Grolmusz's upper bound of O(log2(n) + k2n/2k). We also simplify the proof of Sherstov's [EQUATION] lower bound for the randomized communication complexity of set disjointness.\",\"PeriodicalId\":246506,\"journal\":{\"name\":\"Cybersecurity and Cyberforensics Conference\",\"volume\":\"56 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-06-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"30\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Cybersecurity and Cyberforensics Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4230/LIPIcs.CCC.2015.88\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Cybersecurity and Cyberforensics Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4230/LIPIcs.CCC.2015.88","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 30

摘要

我们证明了在大小为n的全域上k方集合不连接的确定性数额通信复杂度为Ω(n/ 4k)。这给出了第一个对n线性的下界，几乎与Grolmusz的上界O(log2(n) + k2n/2k)相匹配。我们还简化了集不相交随机通信复杂度的Sherstov下界的证明。

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

查看原文本刊更多论文

Simplified Lower Bounds on the Multiparty Communication Complexity of Disjointness

We show that the deterministic number-on-forehead communication complexity of set disjointness for k parties on a universe of size n is Ω(n/ 4k). This gives the first lower bound that is linear in n, nearly matching Grolmusz's upper bound of O(log2(n) + k2n/2k). We also simplify the proof of Sherstov's [EQUATION] lower bound for the randomized communication complexity of set disjointness.

求助全文

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

来源期刊

Cybersecurity and Cyberforensics Conference

自引率

0.00%

发文量