Complexity of sending information in a distributed algorithm
In theoretical computer science, communication complexity studies the amount of communication required to solve a problem when the input to the problem is distributed among two or more parties. The study of communication complexity was first introduced by Andrew Yao in 1979, while studying the problem of computation distributed among several machines.[1]
The problem is usually stated as follows: two parties (traditionally called Alice and Bob) each receive a (potentially different) -bit string and . The goal is for Alice to compute the value of a certain function, , that depends on both and , with the least amount of communication between them.
While Alice and Bob can always succeed by having Bob send his whole -bit string to Alice (who then computes the function ), the idea here is to find clever ways of calculating with fewer than bits of communication. Note that, unlike in computational complexity theory, communication complexity is not concerned with the amount of computation performed by Alice or Bob, or the size of the memory used, as we generally assume nothing about the computational power of either Alice or Bob.
This abstract problem with two parties (called two-party communication complexity), and its general form with more than two parties, is relevant in many contexts. In VLSI circuit design, for example, one seeks to minimize energy used by decreasing the amount of electric signals passed between the different components during a distributed computation. The problem is also relevant in the study of data structures and in the optimization of computer networks. For surveys of the field, see the textbooks by Rao & Yehudayoff (2020) and Kushilevitz & Nisan (2006).
^Yao, A. C. (1979), "Some Complexity Questions Related to Distributive Computing", Proc. Of 11th STOC, 14: 209–213
and 24 Related for: Communication complexity information
In theoretical computer science, communicationcomplexity studies the amount of communication required to solve a problem when the input to the problem...
In computational complexity theory, the exponential time hypothesis is an unproven computational hardness assumption that was formulated by Impagliazzo...
such as the amount of communication (used in communicationcomplexity), the number of gates in a circuit (used in circuit complexity) and the number of processors...
resource that is of most interest is the communicationcomplexity. It is the necessary amount of communication between the executing parties. The number...
communicationcomplexity, the equality of two strings can be verified to some reliability using log n {\displaystyle \log n} bits of communication with...
\log k}{k\log k}}\right)}} communication. The first single-database computational PIR scheme to achieve communicationcomplexity less than n {\displaystyle...
Computational complexity theory, Kolmogorov Complexity, and Computational Biology. Buhrman contributed substantially to the quantum analogue of Communication complexity...
Sandholm study the communicationcomplexity of some common voting rules. Compilation complexity can be seen as one-round communicationcomplexity. Chevaleyre...
No-communication theorem Quantum capacity Quantum communication channel Quantum decision tree complexity Timeline of quantum computing and communication...
involved in communication. Theories of communication try to provide conceptual frameworks to accurately present communication in all its complexity. Some theories...
time and storage. Other complexity measures are also used, such as the amount of communication (used in communicationcomplexity), the number of gates in...
The International Colloquium on Structural Information and CommunicationComplexity (SIROCCO) is an annual academic conference with refereed presentations...
Network complexity is the number of nodes and alternative paths that exist within a computer network, as well as the variety of communication media, communications...
evolutionary, biological, and ecological aspects of animal behavior and communication. Her work focuses on improving the health and welfare of domesticated...
Cognitive complexity describes cognition along a simplicity-complexity axis. It is the subject of academic study in fields including personal construct...
systems, a central complexity measure is the number of synchronous communication rounds required to complete the task. This complexity measure is closely...
ISBN 978-0-387-94618-4. Harsha, Prahladh (September 23, 2011). "Lecture notes on communicationcomplexity" (PDF). Villani, Cédric (2009). Optimal Transport, Old and New...
at least in principle, be realized with today's technology. The communicationcomplexity is only a constant factor larger than the bound Q on the adversary's...
Dissertation Series, 1992), co-author with Eyal Kushilevitz of the book CommunicationComplexity (Cambridge University Press, 1997), and co-author with Shimon Schocken...
Electronic Colloquium on Computational Complexity. Sherstov, Alexander A. (2012). "The CommunicationComplexity of Gap Hamming Distance". Theory of Computing...
In data transmission, parallel communication is a method of conveying multiple binary digits (bits) simultaneously using multiple conductors. This contrasts...
Researchers in interpersonal communication come from many different research paradigms and theoretical traditions, adding to the complexity of the field. Interpersonal...
Global Information
