Games on Relations

  • Stasys Jukna
Part of the Algorithms and Combinatorics book series (AC, volume 27)


The communication complexity of boolean functions is an information theoretic measure of their complexity. Besides its own importance, this measure is closely related to the computational complexity of functions: it corresponds to the smallest depth of circuits computing them. Thus, this measure can be used to prove circuit lower bounds. Communication complexity is appealing not only for its elegance and relation to circuit complexity, but also because its study involves the application of diverse tools from algebra, combinatorics and other fields of mathematics.


Boolean Function Internal Node Communication Protocol Communication Complexity Tiling Number 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Institute of InformaticsUniversity of FrankfurtFrankfurt am MainGermany
  2. 2.Institute of Mathematics and InformaticsVilnius UniversityVilniusLithuania

Personalised recommendations