TY - GEN

T1 - On information complexity in the broadcast model

AU - Braverman, Mark

AU - Oshman, Rotem

N1 - Publisher Copyright:
© Copyright 2015 ACM.

PY - 2015/7/21

Y1 - 2015/7/21

N2 - Information complexity is the extension of classical information theory to the interactive setting, where instead of one-way transmission we are interested in back-and-forth communication. This approach has been very influential in communication complexity, where it enables us to prove powerful lower bounds by quantifying the amount of information the participants in the computation must reveal about their inputs. In this paper we study information complexity in the classical broadcast model: k parties with private inputs wish to compute some function of their inputs, and they communicate by sending messages (one at a time) over a broadcast channel. We measure how much information the players reveal about their inputs to an external observer. This is called external information cost. Using this approach, we prove a tight lower bound of Ω (n log k+ k) on the communication complexity of set disjointness, a fundamental problem in communication complexity. We also give a deterministic matching upper bound. Next we study compression, a central question in information complexity: given a protocol with low information cost (but possibly high communication), can we compress the protocol so that its communication cost matches its information cost? In the twoplayer setting, it is known that every protocol can be compressed to roughly its external information cost. We show that for the multi-party case this is no longer true: There is a gap of at least (k= log k) between external information and communication. However, if we wish to compress many independent instances of the same protocol, then it is possible to do so with an amortized percopy cost that approaches the information cost as the number of copies goes to infinity.

AB - Information complexity is the extension of classical information theory to the interactive setting, where instead of one-way transmission we are interested in back-and-forth communication. This approach has been very influential in communication complexity, where it enables us to prove powerful lower bounds by quantifying the amount of information the participants in the computation must reveal about their inputs. In this paper we study information complexity in the classical broadcast model: k parties with private inputs wish to compute some function of their inputs, and they communicate by sending messages (one at a time) over a broadcast channel. We measure how much information the players reveal about their inputs to an external observer. This is called external information cost. Using this approach, we prove a tight lower bound of Ω (n log k+ k) on the communication complexity of set disjointness, a fundamental problem in communication complexity. We also give a deterministic matching upper bound. Next we study compression, a central question in information complexity: given a protocol with low information cost (but possibly high communication), can we compress the protocol so that its communication cost matches its information cost? In the twoplayer setting, it is known that every protocol can be compressed to roughly its external information cost. We show that for the multi-party case this is no longer true: There is a gap of at least (k= log k) between external information and communication. However, if we wish to compress many independent instances of the same protocol, then it is possible to do so with an amortized percopy cost that approaches the information cost as the number of copies goes to infinity.

UR - http://www.scopus.com/inward/record.url?scp=84957676098&partnerID=8YFLogxK

U2 - 10.1145/2767386.2767425

DO - 10.1145/2767386.2767425

M3 - פרסום בספר כנס

AN - SCOPUS:84957676098

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 355

EP - 364

BT - PODC 2015 - Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing

PB - Association for Computing Machinery

Y2 - 21 July 2015 through 23 July 2015

ER -