This book is devoted to the investigation of a special topic in theoretical computer science - communication complexity as an abstract measure of the complexity of computing problems. Its main aim is to show how the theoretical study of communication complexity can be useful in the process of design
Communication Complexity and Parallel Computing
β Scribed by Juraj HromkoviΔ
- Publisher
- Springer
- Year
- 1997
- Tongue
- English
- Leaves
- 179
- Series
- Texts in Theoretical Computer Science. An EATCS Series
- Category
- Library
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
<p>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 c
<span>Recent developments in the fields of intelligent computing and communication have paved the way for the handling of current and upcoming problems and brought about significant technological advancements. This book presents the proceedings of IConIC 2021, the 4th International Conference on Int
<p><p>This book gives a wide-ranging description of the many facets of complex dynamic networks and systems within an infrastructure provided by integrated control and supervision: envisioning, design, experimental exploration, and implementation. The theoretical contributions and the case studies p