Results 1 to 10 of about 423,241 (305)
Amortized Communication Complexity [PDF]
SIAM Journal on Computing, 1995 Summary: In this work we study the direct-sum problem with respect to communication complexity: Consider a relation \(f\) defined over \(\{0, 1\}^n\times \{0, 1\}^n\). Can the communication complexity of simultaneously computing \(f\) on \(\ell\) instances \((x_1, y_1),\dots, (x_\ell, y_\ell)\) be smaller than the communication complexity of separately
Tomáš Feder +2 more
exaly +4 more sources
Quantum Advantages of Communication Complexity from Bell Nonlocality [PDF]
Entropy, 2021 Communication games are crucial tools for investigating the limitations of physical theories. The communication complexity (CC) problem is a typical example, for which several distributed parties attempt to jointly calculate a given function with limited
Zhih-Ahn Jia +3 more
doaj +2 more sources
Quantum communication complexity advantage implies violation of a Bell inequality [PDF]
Proceedings of the National Academy of Sciences of the United States of America, 2016 We obtain a general connection between a large quantum advantage in communication complexity and Bell nonlocality. We show that given any protocol offering a sufficiently large quantum advantage in communication complexity, there exists a way of ...
Harry Buhrman +2 more
exaly +4 more sources
Communication Complexity of Entanglement-Assisted Multi-Party Computation [PDF]
EntropyWe consider a quantum and a classical version of a multi-party function computation problem with n players, where players 2,…,n need to communicate appropriate information to player 1 so that a “generalized” inner product function with an appropriate ...
Ruoyu Meng, Aditya Ramamoorthy
doaj +2 more sources
Quantum communication and complexity
Theoretical Computer Science, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ronald De Wolf
exaly +3 more sources
Preverbal communication complexity in infants [PDF]
Infancy, 2020 Brenda Salley +2 more
exaly +2 more sources
Communication complexity [PDF]
30th Annual Symposium on Foundations of Computer Science, 1997 A given Boolean function has its input distributed among many parties. The aim is to determine which parties to talk to and what information to exchange with each of them in order to evaluate the function while minimizing the total communication. It is shown that it is possible to obtain the Boolean answer deterministically with only a polynomial ...
Danny Dolev, Tomás Feder
+4 more sources
Communication in complex networks [PDF]
Applied Numerical Mathematics, 2022 28 pages, 7 ...
De la Cruz Cabrera O. +3 more
openaire +2 more sources
Simplex Inter-IC for Wearables and Its Applications
IEEE Access, 2021 We propose a simplex version of Inter-IC for Wearables (I2We), which enables the simultaneous transfer of Inter-Integrated Circuit (I22C)-formatted serial bitstream and dc power over a single transmission line consisting of a pair of conductive textiles.
Akihito Noda, Hiroyuki Shinoda
doaj +1 more source
Compressed Communication Complexity of Hamming Distance
Algorithms, 2021 We consider the communication complexity of the Hamming distance of two strings. Bille et al. [SPIRE 2018] considered the communication complexity of the longest common prefix (LCP) problem in the setting where the two parties have their strings in a ...
Shiori Mitsuya +4 more
doaj +1 more source