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, ...
Read More
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.
Read Less
Add this copy of Communication Complexity and Parallel Computing to cart. $65.74, new condition, Sold by GreatBookPrices rated 4.0 out of 5 stars, ships from Columbia, MD, UNITED STATES, published 2010 by Springer-Verlag Berlin and Heidelberg GmbH & Co. K.
Edition:
2010, Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Publisher:
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Published:
2010
Language:
English
Alibris ID:
17986412595
Shipping Options:
Standard Shipping: $4.99
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Texts in Theoretical Computer Science. An EATCS Series . X, 336 p. Intended for professional and scholarly audience. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Add this copy of Communication Complexity and Parallel Computing to cart. $65.75, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 2010 by Springer-Verlag Berlin and Heidelberg GmbH & Co. K.
Edition:
2010, Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Add this copy of Communication Complexity and Parallel Computing to cart. $80.01, new condition, Sold by Ria Christie Books rated 5.0 out of 5 stars, ships from Uxbridge, MIDDLESEX, UNITED KINGDOM, published 2010 by Springer-Verlag Berlin and Heidelberg GmbH & Co. K.
Edition:
2010, Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Add this copy of Communication Complexity and Parallel Computing (Texts to cart. $92.35, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Newport Coast, CA, UNITED STATES, published 2010 by Springer.
Edition:
2010, Springer-Verlag Berlin and Heidelberg GmbH & Co. K
