Search results

...r science]], the '''log-rank conjecture''' states that the deterministic [[communication complexity]] of a two-party [[Boolean function]] is polynomially related to | title = Möbius Functions and Communication Complexity ...

{{Short description|Problem in communication complexity theory}} ...f Alice and Bob are each given <math>n</math>-bit strings, there exists no communication protocol that lets Alice compute the hamming distance between their strings ...

...ter science]], '''multiparty communication complexity''' is the study of [[communication complexity]] in the setting where there are more than 2 players. In the traditional two–party [[communication complexity|communication game]], introduced by {{harvtxt|Yao|1979}},<ref>{{citation ...

...ation games on networks. The solution concept and the class of cooperative communication games it applies to was introduced by [[Roger Myerson]] in 1977.<ref name = A (transferable utility) [[Cooperative game theory| cooperative game]] is defined as a pair <math>(N, v)</math>, where <math>N ...

...s optimally transfers partial information using entanglement and classical communication. It allows for sending information using an amount of entanglement given by .../math>. The case where the classical communication is replaced by quantum communication was considered in.<ref>{{cite journal|arxiv=quant-ph/0606225 |doi=10.1098/ ...

...York|isbn=978-1461403647|pages=281|edition=3rd}}</ref> It's mainly used in communication systems.<ref name=Book1/> * {{cite book|last=Simon|first=Marvin K.|title=Digital Communication over Fading Channels|year=2005|publisher=John Wiley & Sons|location=Hoboken ...

...computing |chapter=Exponential separation of quantum and classical one-way communication complexity |date=2004-06-13|chapter-url=https://doi.org/10.1145/1007352.100 ...C-2020-1.pdf|journal=15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020)|series=Leibniz International Proceedings in Inf ...

...|author=Shannon, Claude E. |date=July 1948 |title=A Mathematical Theory of Communication [reprint with corrections] |url=http://math.harvard.edu/~ctm/home/text/othe [[Shannon–Fano coding]] methods gave rise to the field of information theory and without its contributions, the world would not have any of the many suc ...

...rst1=Stephen |author1-link=Stephen Morris (economist) |title=Coordination, Communication, and Common Knowledge: a Retrospective on the Electronic-mail Game |journal === Email communication === ...

...to analyze the effect of [[Interference (communication)|interference]] in communication channels. The model consists of two pairs of users communicating through a ...channel the presence of the signal from the other user may also impair the communication. However, since the transmitted signals are not purely random (otherwise th ...

...of two costs (in terms of time and energy): arithmetic and communication. Communication, in this context refers to moving data, either between levels of memory or == Formal theory == ...

...e=Osborne>Osborne, Martin J., and [[Ariel Rubinstein]]. ''A Course in Game Theory''. Cambridge, MA: MIT, 1994. Print.</ref>{{rp|73}} However, mutual knowledg ...w.russelldale.com/dissertation/1996.RussellDale.TheTheoryOfMeaning.pdf The Theory of Meaning]'' (1996).</ref> ...

...o another <math>| \phi \rangle</math> using local operations and classical communication if and only if <math>\lambda_{\psi}</math> is majorized by <math>\lambda_{\ [[Category:Quantum information theory]] ...

...rnheim|author2=B. Peleg|author3=M. D. Whinston|journal=Journal of Economic Theory|volume=42|year=1987|pages=1–12|doi=10.1016/0022-0531(87)90099-8|doi-access= ...roofNashEquilibrium"/> In the coalition-proof Nash equilibrium the private communication is limited.<ref name="CoalitionProofNashEquilibrium"/> ...

In the theory of parallel algorithms, the '''1-vs-2 cycles problem''' concerns a simplifi ...communication]] model requires at least a logarithmic number of rounds of communication, even for a randomized algorithm that succeeds with high probability (havin ...

...is an algorithm that implements a [[Broadcasting (networking)|broadcast]] communication pattern on a [[Distributed computing|distributed system]] using [[message p ...e bandwidth in the [[Duplex (telecommunications)#Full duplex|full-duplex]] communication model while having a startup latency logarithmic in the number of partaking ...

{{Short description|Information theory quantity}} ...of a certain signal of interest divided by the sum of the [[Interference (communication)|interference]] power (from all the other interfering signals) and the powe ...

{{Short description|Communication channel with unknown parameters that can change over time}} ...f the [[Channel model|channel]] is known, to be more realistic to actual [[Communication channel|network channel]] situations. ...

...ntrol (PU²RC) was proposed in US Patent No. 7,324,480, ''Mobile communication apparatus and method including base station and mobile station having multi * [[Multi-user MIMO]] as the advanced MIMO communication technology ...

...s [[MapReduce]], and frequently applied to algorithmic problems in [[graph theory]].{{r|iklmv}} ...t of information sent or received by a single machine in a single round of communication must be <math>O(S)</math>. The goal in designing algorithms for this model ...