Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Jukna, S. (2012). Games on Relations. In: Boolean Function Complexity. Algorithms and Combinatorics, vol 27. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24508-4_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-24508-4_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24507-7
Online ISBN: 978-3-642-24508-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)