Communication Complexity and Parallel Computing: The by Juraj Hromkovič

By Juraj Hromkovič

The communique complexity of two-party protocols is an in simple terms 15 years previous complexity degree, however it is already thought of to be one of many fundamen­ tal complexity measures of contemporary complexity concept. equally to Kolmogorov complexity within the concept of sequential computations, communique complicated­ ity is used as a style for the examine of the complexity of concrete computing difficulties in parallel info processing. specifically, it really is utilized to turn out decrease bounds that say what desktop assets (time, undefined, reminiscence dimension) are essential to compute the given job. along with the estimation of the compu­ tational hassle of computing difficulties the proved reduce bounds are beneficial for proving the optimality of algorithms which are already designed. in certain cases the data concerning the verbal exchange complexity of a given challenge can be even useful in trying to find effective algorithms to this challenge. The examine of conversation complexity turns into a well-defined indepen­ dent region of complexity concept. as well as a powerful relation to a number of funda­ psychological complexity measures (and so that you can numerous basic difficulties of com­ plexity thought) verbal exchange complexity has contributed to the learn and to the certainty of the character of determinism, nondeterminism, and random­ ness in algorithmics. There already exists a non-trivial mathematical equipment to address the communique complexity of concrete computing difficulties, which provides a wish that the process in line with conversation complexity should be in­ strumental within the learn of numerous significant open difficulties of contemporary complexity theory.

Show description

Read Online or Download Communication Complexity and Parallel Computing: The Application of Communication Complexity in Parallel Computing (Texts in Theoretical Computer Science. An EATCS Series) PDF

Similar logic books

The Correctness-by-Construction Approach to Programming

The point of interest of this booklet is on bridging the distance among severe equipment for constructing software program. at the one hand, there are texts and methods which are so formal that they scare off all however the such a lot devoted theoretical computing device scientists. at the different, there are a few who think that any degree of ritual is a waste of time, leading to software program that's built by means of following intestine emotions and intuitions.

Function Algebras on Finite Sets: Basic Course on Many-Valued Logic and Clone Theory (Springer Monographs in Mathematics)

Functionality Algebras on Finite units offers a huge creation to the topic, prime as much as the innovative of study. the overall recommendations of the common Algebra are given within the first a part of the ebook, to familiarize the reader from the very starting on with the algebraic part of functionality algebras.

Facets of Uncertainties and Applications: ICFUA, Kolkata, India, December 2013 (Springer Proceedings in Mathematics & Statistics)

Because the emergence of the formal idea of chance thought within the 17th century, uncertainty has been perceived completely by way of likelihood thought. in spite of the fact that, this it seems that certain hyperlink among uncertainty and likelihood conception has come lower than research a couple of many years again. Uncertainties are these days approved to be of assorted varieties.

Admissible Sets and Structures (Perspectives in Logic)

Due to the fact that their inception, the views in common sense and Lecture Notes in common sense sequence have released seminal works by means of major logicians. the various unique books within the sequence were unavailable for years, yet they're now in print once more. Admissible set thought is an important resource of interplay among version thought, recursion conception and set concept, and performs a huge function in definability idea.

Additional resources for Communication Complexity and Parallel Computing: The Application of Communication Complexity in Parallel Computing (Texts in Theoretical Computer Science. An EATCS Series)

Example text

Download PDF sample

Rated 4.97 of 5 – based on 20 votes