TY - BOOK ID - 184984 TI - Communication complexity and parallel computing PY - 1997 SN - 354057459X 3642081851 3662034425 PB - Berlin Springer DB - UniCat KW - Mathematical control systems KW - Computer science KW - Computational complexity. KW - Parallel processing (Electronic computers) KW - Parallel processing (Electronic computers). KW - Architecture, Computer. KW - Computers. KW - Computer communication systems. KW - Input-output equipment (Computers). KW - Electrical engineering. KW - Mathematical logic. KW - Computer System Implementation. KW - Theory of Computation. KW - Computer Communication Networks. KW - Input/Output and Data Communications. KW - Communications Engineering, Networks. KW - Mathematical Logic and Formal Languages. KW - Algebra of logic KW - Logic, Universal KW - Mathematical logic KW - Symbolic and mathematical logic KW - Symbolic logic KW - Mathematics KW - Algebra, Abstract KW - Metamathematics KW - Set theory KW - Syllogism KW - Electric engineering KW - Engineering KW - Computer hardware KW - Computer I/O equipment KW - Computers KW - Electronic analog computers KW - Electronic digital computers KW - Hardware, Computer KW - I/O equipment (Computers) KW - Input equipment (Computers) KW - Input-output equipment (Computers) KW - Output equipment (Computers) KW - Computer systems KW - Communication systems, Computer KW - Computer communication systems KW - Data networks, Computer KW - ECNs (Electronic communication networks) KW - Electronic communication networks KW - Networks, Computer KW - Teleprocessing networks KW - Data transmission systems KW - Digital communications KW - Electronic systems KW - Information networks KW - Telecommunication KW - Cyberinfrastructure KW - Electronic data processing KW - Network computers KW - Automatic computers KW - Automatic data processors KW - Computing machines (Computers) KW - Electronic brains KW - Electronic calculating-machines KW - Electronic computers KW - Cybernetics KW - Machine theory KW - Calculators KW - Cyberspace KW - Architecture, Computer KW - Input-output equipment KW - Distributed processing KW - High performance computing KW - Multiprocessors KW - Parallel programming (Computer science) KW - Supercomputers UR - https://www.unicat.be/uniCat?func=search&query=sysid:184984 AB - 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. ER -