Games on 0-1 Matrices

Chapter
Part of the Algorithms and Combinatorics book series (AC, volume 27)

Abstract

We have already seen that communication complexity of relations captures the depth of circuits. Protocols in this case are trying to solve search problems. In this chapter we consider the communication complexity of decision problems.

Preview

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