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
LEADER 03156nmm a2200397 u 4500
001 EB000686269
003 EBX01000000000000000539351
005 00000000000000.0
007 cr|||||||||||||||||||||
008 140122 ||| eng
020 |a 9783662034422 
100 1 |a Hromkovič, Juraj 
245 0 0 |a Communication Complexity and Parallel Computing  |h Elektronische Ressource  |c by Juraj Hromkovič 
250 |a 1st ed. 1997 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 1997, 1997 
300 |a X, 336 p  |b online resource 
505 0 |a 1 Introduction -- 2 Communication Protocol Models -- 3 Boolean Circuits -- 4 VLSI Circuits and Interconnection Networks -- 5 Sequential Computations -- References 
653 |a Computer Communication Networks 
653 |a Computer systems 
653 |a Computer science 
653 |a Computer System Implementation 
653 |a Formal Languages and Automata Theory 
653 |a Computer networks  
653 |a Machine theory 
653 |a Input/Output and Data Communications 
653 |a Telecommunication 
653 |a Computer input-output equipment 
653 |a Communications Engineering, Networks 
653 |a Theory of Computation 
041 0 7 |a eng  |2 ISO 639-2 
989 |b SBA  |a Springer Book Archives -2004 
490 0 |a Texts in Theoretical Computer Science. An EATCS Series 
028 5 0 |a 10.1007/978-3-662-03442-2 
856 4 0 |u https://doi.org/10.1007/978-3-662-03442-2?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 004.2 
520 |a 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 complex­ ity is used as a method for the study of the complexity of concrete computing problems in parallel information processing. Especially, it is applied to prove lower bounds that say what computer resources (time, hardware, memory size) are necessary to compute the given task. Besides the estimation of the compu­ tational difficulty of computing problems the proved lower bounds are useful for proving the optimality of algorithms that are already designed. In some cases the knowledge about the communication complexity of a given problem may be even helpful in searching for efficient algorithms to this problem. The study of communication complexity becomes a well-defined indepen­ dent area of complexity theory. In addition to a strong relation to several funda­ mental complexity measures (and so to several fundamental problems of com­ plexity theory) communication complexity has contributed to the study and to the understanding of the nature of determinism, nondeterminism, and random­ ness in algorithmics. There already exists a non-trivial mathematical machinery to handle the communication complexity of concrete computing problems, which gives a hope that the approach based on communication complexity will be in­ strumental in the study of several central open problems of recent complexity theory