| 书目名称 | Communication Complexity and Parallel Computing |
| 编辑 | Juraj Hromkovič |
| 视频video | http://file.papertrans.cn/231/230391/230391.mp4 |
| 丛书名称 | Texts in Theoretical Computer Science. An EATCS Series |
| 图书封面 |  |
| 描述 | 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 contribu |
| 出版日期 | Textbook 1997 |
| 关键词 | Boolean circuits; Boolean functions; Formale Sprachen; Heuristics; Kommunikationskomplexität; Parallele B |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-662-03442-2 |
| isbn_softcover | 978-3-642-08185-9 |
| isbn_ebook | 978-3-662-03442-2Series ISSN 1862-4499 Series E-ISSN 1862-4502 |
| issn_series | 1862-4499 |
| copyright | Springer-Verlag Berlin Heidelberg 1997 |
|Archiver|手机版|小黑屋|
派博传思国际
( 京公网安备110108008328)
GMT+8, 2025-8-24 12:05
发表于 2025-3-21 18:46:07
