《通信複雜性和並行計算》是2000年6月1日世界圖書出版公司出版的圖書，作者是Juraj Hromkovic。
基本介紹
- 中文名：通信複雜性和並行計算
- 作者：Juraj Hromkovic
- 出版社：世界圖書出版公司
- 出版時間：2000年6月1日
- 定價：49 元
- ISBN：9787506247368
內容簡介,目錄,
內容簡介
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.
目錄
1 Introduction
1.1 Motivation and Aims
1.2 Concept and Organization
1.3 How to Read the Book
2 Communication Protocol Models
2.1 Basic Notions
2.1.1 Introduction
2.1.2 Alphabets, Words, and Languages
2.1.3 Boolean Functions and Boolean Matrices
2.1.4 Representation of Computing Problems
2.1.5 Exercises
2.2 Communication Complexity According to a Fixed Partition
2.2.1 Definitions
2.2.2 Methods for Proving Lower Bounds
2.2.3 Theoretical Properties of Communication Complexity According to a Fixed Partition
2.2.4 Exercises
2.2.5 Research Problems
2.3 Communication Complexity
2.3.1 Introduction
