发布求助
文献互助 智能选刊 最新文献

论通信的复杂性大于

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI:10.1109/ALLERTON.2015.7447037
Sivaramakrishnan Natarajan Ramamoorthy, Makrand Sinha
{"title":"论通信的复杂性大于","authors":"Sivaramakrishnan Natarajan Ramamoorthy, Makrand Sinha","doi":"10.1109/ALLERTON.2015.7447037","DOIUrl":null,"url":null,"abstract":"We give a simple information theoretic proof that the public-coin randomized communication complexity of the greater-than function is Ω(logn) for bit-strings of length n.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"221 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"On the communication complexity of greater-than\",\"authors\":\"Sivaramakrishnan Natarajan Ramamoorthy, Makrand Sinha\",\"doi\":\"10.1109/ALLERTON.2015.7447037\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We give a simple information theoretic proof that the public-coin randomized communication complexity of the greater-than function is Ω(logn) for bit-strings of length n.\",\"PeriodicalId\":112948,\"journal\":{\"name\":\"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)\",\"volume\":\"221 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ALLERTON.2015.7447037\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ALLERTON.2015.7447037","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

我们给出了一个简单的信息论证明，对于长度为n的比特串，公共币的大于函数的随机通信复杂度为Ω(logn)。
本文章由计算机程序翻译，如有差异，请以英文原文为准。
分享
查看原文 本刊更多论文
On the communication complexity of greater-than
We give a simple information theoretic proof that the public-coin randomized communication complexity of the greater-than function is Ω(logn) for bit-strings of length n.
求助全文
通过发布文献求助，成功后即可免费获取论文全文。 去求助
来源期刊
2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)
2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信