Affiliation:
1. University of California, San Diego, CA, USA
2. Tsinghua University., Beijing, China
Abstract
Communication complexity studies the amount of communication necessary to compute a function whose value depends on information distributed among several entities. Yao [Yao79] initiated the study of communication complexity more than 40 years ago, and it has since become a central eld in theoretical computer science with many applications in diverse areas such as data structures, streaming algorithms, property testing, approximation algorithms, coding theory, and machine learning. The textbooks [KN06,RY20] provide excellent overviews of the theory and its applications.
Publisher
Association for Computing Machinery (ACM)
Reference63 articles.
1. Complexity measures and decision tree complexity: a survey;Buhrman Harry;Theoretical Computer Science,2002
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On (simple) decision tree rank;Theoretical Computer Science;2023-11
2. Randomized versus Deterministic Decision Tree Size;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02