Skip to main content

Interactive information complexity

Author(s): Braverman, Mark

To refer to this page use:
Abstract: The primary goal of this paper is to define and study the interactive information complexity of functions. Let f(x,y) be a function, and suppose Alice is given x and Bob is given y. Informally, the interactive information complexity IC(f) of f is the least amount of information Alice and Bob need to reveal to each other to compute f. Previously, information complexity has been defined with respect to a prior distribution on the input pairs (x,y). Our first goal is to give a definition that is independent of the prior distribution. We show that several possible definitions are essentially equivalent. We establish some basic properties of the interactive information complexity IC(f). In particular, we show that IC(f) is equal to the amortized (randomized) communication complexity of f. We also show a direct sum theorem for IC(f) and give the first general connection between information complexity and (non-amortized) communication complexity. This connection implies that a non-trivial exchange of information is required when solving problems that have non-trivial communication complexity. We explore the information complexity of two specific problems - Equality and Disjointness. We show that only a constant amount of information needs to be exchanged when solving Equality with no errors, while solving Disjointness with a constant error probability requires the parties to reveal a linear amount of information to each other.
Publication Date: 2012
Citation: Braverman, Mark. "Interactive information complexity." Proceedings of the forty-fourth annual ACM symposium on Theory of computing (2012), pp. 505-524. doi:10.1145/2213977.2214025
DOI: 10.1145/2213977.2214025
Pages: 505 - 524
Type of Material: Conference Article
Journal/Proceeding Title: Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Version: Author's manuscript

Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.