Communication Complexity

Rating:
Summary: THE book to read in this field
Review: Communication Complexity studies how many bits ALICE and BOB have to exchange to computer a function. Questinos of this sort are interesting in and of themselves AND also because they help proof lower Bounds on models of computation like circuits and decision trees. THIS book is readable and gives you all the basics that you need. The authors present clean proofs of basic theorems on how many bits are needed, and also supply links to other models nicely, and proof lower bounds on those models. This should be in the library of every theoretical computer scientist and every computer scientist that works on communication protocols. ([e-mail])

Rating:
Summary: THE book to read in this field
Review: Communication Complexity studies how many bits ALICE and BOB have to exchange to computer a function. Questinos of this sort are interesting in and of themselves AND also because they help proof lower Bounds on models of computation like circuits and decision trees. THIS book is readable and gives you all the basics that you need. The authors present clean proofs of basic theorems on how many bits are needed, and also supply links to other models nicely, and proof lower bounds on those models. This should be in the library of every theoretical computer scientist and every computer scientist that works on communication protocols. ([e-mail])