Results 11 to 20 of about 5,642,848 (291)
Preverbal communication complexity in infants [PDF]
Infancy, 2020 The development of prelinguistic communication in typically developing infants is marked by changes in complexity as well as frequency, yet most measures focus on frequency. In the current study we used the Communication Complexity Scale (CCS) to measure
Kandace Fleming +2 more
exaly +3 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 Significance For many communication complexity problems the quantum strategies, distinguished by using Bell nonlocal correlations, provide exponential advantage over the best possible classical strategies.
Michal Horodecki +2 more
exaly +4 more sources
Journal of Computer and System Sciences, 1984 Suppose that a language \(L\subseteq \{0,1\}^*\) must be recognized by two distant computers. Each computer receives half of the input bits, and the computation proceeds using some protocol for communication between the two computers (obviously, most interesting languages cannot be recognized with any communication). The minimum number of bits that has
C. Papadimitriou, M. Sipser
semanticscholar +4 more sources
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
Noam Nisan +2 more
exaly +3 more sources
The Communication Complexity of Optimization [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2019 We consider the communication complexity of a number of distributed optimization problems. We start with the problem of solving a linear system. Suppose there is a coordinator together with $s$ servers $P_1, \ldots, P_s$, the $i$-th of which holds a ...
S. Vempala +2 more
semanticscholar +4 more sources
Communication complexity of estimating correlations [PDF]
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019 We characterize the communication complexity of the following distributed estimation problem. Alice and Bob observe infinitely many iid copies of ρ-correlated unit-variance (Gaussian or ±1 binary) random variables, with unknown ρ∈[−1,1]. By interactively
U. Hadar +3 more
semanticscholar +5 more sources
The communication complexity of local search [PDF]
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2018 We study a communication variant of local search. There is some fixed, commonly known graph G. Alice holds fA and Bob holds fB, both are functions that specify a value for each vertex. The goal is to find a local maximum of fA+fB with respect to G, i.e.,
Y. Babichenko +2 more
semanticscholar +4 more sources
Exponential Communication Complexity Advantage from Quantum Superposition of the Direction of Communication [PDF]
Physical Review Letters, 2016 In communication complexity, a number of distant parties have the task of calculating a distributed function of their inputs, while minimizing the amount of communication between them.
Adrien Féix +2 more
exaly +2 more sources
The Landscape of Communication Complexity Classes [PDF]
computational complexity, 2018 We prove several results which, together with prior work, provide a nearly-complete picture of the relationships among classical communication complexity classes between P\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{
Mika Göös, T. Pitassi, Thomas Watson
semanticscholar +6 more sources
Quantum Advantages of Communication Complexity from Bell Nonlocality. [PDF]
Entropy (Basel), 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
Jia ZA, Wei L, Wu YC, Guo GC.
europepmc +2 more sources