Skip to main content
SpringerLink
Log in

Communication Complexity and Parallel Computing

  • Textbook
  • © 1997

Overview

Authors:
  1. Juraj Hromkovič

    1. Institut für Informatik und Praktische Mathematik, Universität Kiel, Kiel, Germany

    View author publications

    You can also search for this author in PubMed   Google Scholar

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (5 chapters)

  1. Front Matter

    Pages i-x
    Download chapter PDF

  2. Introduction

    • Juraj Hromkovič
    Pages 1-6

  3. Communication Protocol Models

    • Juraj Hromkovič
    Pages 7-149

  4. Boolean Circuits

    • Juraj Hromkovič
    Pages 151-240

  5. VLSI Circuits and Interconnection Networks

    • Juraj Hromkovič
    Pages 241-281

  6. Sequential Computations

    • Juraj Hromkovič
    Pages 283-315

  7. Back Matter

    Pages 317-339
    Download chapter PDF
Back to top

Keywords

About this book

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.

Authors and Affiliations

  • Institut für Informatik und Praktische Mathematik, Universität Kiel, Kiel, Germany

    Juraj Hromkovič

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation