Communication Complexity


Book Description

Communication complexity is the mathematical study of scenarios where several parties need to communicate to achieve a common goal, a situation that naturally appears during computation. This introduction presents the most recent developments in an accessible form, providing the language to unify several disjoint research subareas. Written as a guide for a graduate course on communication complexity, it will interest a broad audience in computer science, from advanced undergraduates to researchers in areas ranging from theory to algorithm design to distributed computing. The first part presents basic theory in a clear and illustrative way, offering beginners an entry into the field. The second part describes applications including circuit complexity, proof complexity, streaming algorithms, extension complexity of polytopes, and distributed computing. Proofs throughout the text use ideas from a wide range of mathematics, including geometry, algebra, and probability. Each chapter contains numerous examples, figures, and exercises to aid understanding.




Communication Complexity


Book Description

Surveys the mathematical theory and applications such as computer networks, VLSI circuits, and data structures.




Lower Bounds in Communication Complexity


Book Description

The communication complexity of a function f(x, y) measures the number of bits that two players, one who knows x and the other who knows y, must exchange to determine the value f(x, y). Communication complexity is a fundamental measure of complexity of functions. Lower bounds on this measure lead to lower bounds on many other measures of computational complexity. This monograph surveys lower bounds in the field of communication complexity. Our focus is on lower bounds that work by first representing the communication complexity measure in Euclidean space. That is to say, the first step in these lower bound techniques is to find a geometric complexity measure, such as rank or trace norm, that serves as a lower bound to the underlying communication complexity measure. Lower bounds on this geometric complexity measure are then found using algebraic and geometric tools.




Structural Information and Communication Complexity


Book Description

This book constitutes the refereed conference proceedings of the 28th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2021, held in Wrocław, Poland, in June 2021. Due to COVID-19, the conference will be held online. The 20 full papers presented in this book were carefully reviewed and selected from 48 submissions. The papers are solicited from all areas of study of local structural knowledge and global communication and computational complexities. Among the typical areas are distributed computing, communication networks, game theory, parallel computing, social networks, mobile computing




Communication Complexity (for Algorithm Designers)


Book Description

This book deals mostly with impossibility results - lower bounds on what can be accomplished by algorithms. However, the perspective is unapologetically that of an algorithm designer. The reader will learn lower bound technology on a "need-to-know" basis, guided by fundamental algorithmic problems that we care about.




Corporate Communications


Book Description

The field of corporate communications describes the practices organizations use to communicate as coherent corporate `bodies′. Drawing on the metaphor of the body and on a variety of theories and disciplines the text challenges the idealized notion that organizations can and should communicate as unified wholes. The authors pose important questions such as: - Where does the central idea of corporate communications come from? - What are the underlying assumptions of most corporate communications practices? - What are the organizational and ethical challenges of attempting truly `corporate′ communication? Clearly written with international vignettes and executive briefings, this book shows that in a complex world the management of communication needs to embrace multiple opinions and voices. Rewarding readers with a deeper understanding of corporate communications, the text will be a `must read′ for advanced undergraduates, graduate students, and scholars, in the arenas of corporate communications, organizational communication, employee relations, marketing, public relations and corporate identity management. Practitioners in these areas will be provoked to re-examine their assumptions and habits.




Boolean Function Complexity


Book Description

Boolean circuit complexity is the combinatorics of computer science and involves many intriguing problems that are easy to state and explain, even for the layman. This book is a comprehensive description of basic lower bound arguments, covering many of the gems of this “complexity Waterloo” that have been discovered over the past several decades, right up to results from the last year or two. Many open problems, marked as Research Problems, are mentioned along the way. The problems are mainly of combinatorial flavor but their solutions could have great consequences in circuit complexity and computer science. The book will be of interest to graduate students and researchers in the fields of computer science and discrete mathematics.




An Introduction to Kolmogorov Complexity and Its Applications


Book Description

Briefly, we review the basic elements of computability theory and prob ability theory that are required. Finally, in order to place the subject in the appropriate historical and conceptual context we trace the main roots of Kolmogorov complexity. This way the stage is set for Chapters 2 and 3, where we introduce the notion of optimal effective descriptions of objects. The length of such a description (or the number of bits of information in it) is its Kolmogorov complexity. We treat all aspects of the elementary mathematical theory of Kolmogorov complexity. This body of knowledge may be called algo rithmic complexity theory. The theory of Martin-Lof tests for random ness of finite objects and infinite sequences is inextricably intertwined with the theory of Kolmogorov complexity and is completely treated. We also investigate the statistical properties of finite strings with high Kolmogorov complexity. Both of these topics are eminently useful in the applications part of the book. We also investigate the recursion theoretic properties of Kolmogorov complexity (relations with Godel's incompleteness result), and the Kolmogorov complexity version of infor mation theory, which we may call "algorithmic information theory" or "absolute information theory. " The treatment of algorithmic probability theory in Chapter 4 presup poses Sections 1. 6, 1. 11. 2, and Chapter 3 (at least Sections 3. 1 through 3. 4).




Interorganizational Collaboration


Book Description

Interorganizational Collaboration: Complexity, Ethics, and Communication centers around three key assertions: (1) interorganizational collaboration is complex and warrants study as a specific type of leadership and communication; (2) successful collaborative relationships are grounded in a principled ethic of democratic and egalitarian participation; and (3) interorganizational collaboration requires a specific communication language of practice. Interorganizational collaboration is influenced by increased interconnectedness, shifting organizational needs, and a changing workforce. Collaboration invokes ethical questions and ethical responsibilities that must be considered in communication practices and structures. Although there are many popular books and practitioner materials on collaboration, most are not focused on introducing foundational concepts to a novice audience. In addition, the subject of communication in collaboration has been somewhat underdeveloped. The authors focus on communication from a social constructionist stance. One of their primary goals is to develop a collaboration pedagogy based on existing communication scholarship. The authors present communicative practices vital to interorganizational participation, and they view collaboration as something beyond an exchange of resources and knowledge. Unlike group and organizational texts that approach collaboration from a functional or strategic perspective, this text anchors collaboration in the assumption that democratic and principled communication will foster creative and accountable outcomes for participants in collaborative problem solving. The authors articulate a collaborative ethic useful in all communicative contexts. Micropractices of communication are fundamental not only to collaborating across organizations but also to fostering just and trusting relationships. The book discusses the cornerstone assumptions and principled practices necessary for stakeholders to address problems—for example, recognizing and validating the needs of fellow stakeholders; separating people’s positions from underlying interests; listening for things that are never quite said; identifying overlapping commonalities; building trust while respecting difference; and constructively navigating conflict. The book also focuses on building collaborative praxis based on the assumption of contingency. Praxis cultivates knowledge and ethical understanding of a situation so participants in collaborations can make the best decision based on specific circumstances.




Computational Complexity


Book Description

New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.