Communication Complexity and Parallel Computing

The communication complexity of two-party protocols is an only 15 years old complexity measure, but it is already considered to be one of the fundamen­ tal complexity measures of recent complexity theory. Similarly to Kolmogorov complexity in the theory of sequential computations, communication comp...

Full description

Bibliographic Details
Main Author: Hromkovič, Juraj
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 1997, 1997
Edition:1st ed. 1997
Series:Texts in Theoretical Computer Science. An EATCS Series
Subjects:
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
Table of Contents:
  • 1 Introduction
  • 2 Communication Protocol Models
  • 3 Boolean Circuits
  • 4 VLSI Circuits and Interconnection Networks
  • 5 Sequential Computations
  • References