A Direct Product Theorem for Two-Party Bounded-Round Public-Coin Communication Complexity-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A Direct Product Theorem for Two-Party Bounded-Round Public-Coin Communication Complexity

Published:2015-12-18 Issue:3 Volume:76 Page:720-748
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Jain Rahul,Pereszlényi Attila,Yao Penghui

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00453-015-0100-0.pdf

Reference41 articles.

1. Ambainis, A., Špalek, R., de Wolf, R.: A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs. Algorithmica 55(3), 422–461 (2009). doi: 10.1007/s00453-007-9022-9

2. Bar-Yossef, Z., Jayram, T., Kumar, R., Sivakumar, D.: An information statistics approach to data stream and communication complexity. In: Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, FOCS ’02, pp. 209–218 (2002). doi: 10.1109/SFCS.2002.1181944

3. Barak, B., Braverman, M., Chen, X., Rao, A.: How to compress interactive communication. SIAM J. Comput. 42(3), 1327–1363 (2013). doi: 10.1137/100811969

4. Ben-Aroya, A., Regev, O., de Wolf, R.: A hypercontractive inequality for matrix-valued functions with applications to quantum computing and LDCs. In: Proceedings of the 49rd Annual IEEE Symposium on Foundations of Computer Science, FOCS ’08, pp. 477–486 (2008). doi: 10.1109/FOCS.2008.45

5. Braverman, M., Rao, A.: Information equals amortized communication. IEEE Trans. Inf. Theory 60(10), 6058–6069 (2014). doi: 10.1109/TIT.2014.2347282

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Lifting query complexity to time-space complexity for two-way finite automata;Journal of Computer and System Sciences;2024-05

2. A direct product theorem for quantum communication complexity with applications to device-independent QKD;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02

3. Chain-Rules for Channel Capacity;2021 IEEE International Symposium on Information Theory (ISIT);2021-07-12

4. The Communication Complexity of Set Intersection and Multiple Equality Testing;SIAM Journal on Computing;2021-01

5. Trading Information Complexity for Error;Theory of Computing;2018

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3