Information lower bounds via self-reducibility

Mark Braverman, Ankit Garg, Denis Pankratov, Omri Weinstein

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

11 Scopus citations


We use self-reduction methods to prove strong information lower bounds on two of the most studied functions in the communication complexity literature: Gap Hamming Distance (GHD) and Inner Product (IP). In our first result we affirm the conjecture that the information cost of GHD: is linear even under the uniform distribution, which strengthens the Ω(n) bound recently shown by [15], and answering an open problem from [10]. In our second result we prove that the information cost of IP n is arbitrarily close to the trivial upper bound n as the permitted error tends to zero, again strengthening the Ω(n) lower bound recently proved by [9]. Our proofs demonstrate that self-reducibility makes the connection between information complexity and communication complexity lower bounds a two-way connection. Whereas numerous results in the past [13,2,3] used information complexity techniques to derive new communication complexity lower bounds, we explore a generic way in which communication complexity lower bounds imply information complexity lower bounds in a black-box manner.

Original languageAmerican English
Title of host publicationComputer Science - Theory and Applications - 8th International Computer Science Symposium in Russia, CSR 2013
PublisherSpringer Verlag
Number of pages12
ISBN (Print)9783642385353
StatePublished - 2013
Externally publishedYes
Event8th International Computer Science Symposium in Russia, CSR 2013 - Ekaterinburg, Russian Federation
Duration: 25 Jun 201329 Jun 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7913 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference8th International Computer Science Symposium in Russia, CSR 2013
Country/TerritoryRussian Federation


Dive into the research topics of 'Information lower bounds via self-reducibility'. Together they form a unique fingerprint.

Cite this