Results 21 to 30 of about 5,642,848 (291)
Quantum communication and complexity
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ronald De Wolf
exaly +3 more sources
EF21-P and Friends: Improved Theoretical Communication Complexity for Distributed Optimization with Bidirectional Compression [PDF]
In this work we focus our attention on distributed optimization problems in the context where the communication time between the server and the workers is non-negligible.
Kaja Gruntkowska +2 more
semanticscholar +1 more source
Quantum Contextuality Provides Communication Complexity Advantage. [PDF]
Despite the conceptual importance of contextuality in quantum mechanics, there is a hitherto limited number of applications requiring contextuality but not entanglement.
Shashank Gupta +4 more
semanticscholar +1 more source
Communication Complexity [PDF]
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 Complexity of Entanglement-Assisted Multi-Party Computation. [PDF]
We 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 ...
Meng R, Ramamoorthy A.
europepmc +2 more sources
Communication in complex networks [PDF]
28 pages, 7 ...
De la Cruz Cabrera O. +3 more
openaire +2 more sources
Dimension-free bounds and structural results in communication complexity
The purpose of this article is to initiate a systematic study of dimension-free relations between basic communication and query complexity measures and various matrix norms. In other words, our goal is to obtain inequalities that bound a parameter solely
Lianna Hambardzumyan +2 more
semanticscholar +1 more source
The one-way communication complexity of submodular maximization with applications to streaming and robustness [PDF]
We consider the classical problem of maximizing a monotone submodular function subject to a cardinality constraint, which, due to its numerous applications, has recently been studied in various computational models. We consider a clean multi-player model
Moran Feldman +3 more
semanticscholar +1 more source
Placing Conditional Disclosure of Secrets in the Communication Complexity Universe
In the conditional disclosure of secrets (CDS) problem (Gertner et al. in J Comput Syst Sci, 2000) Alice and Bob, who hold n-bit inputs x and y respectively, wish to release a common secret z to Carol, who knows both x and y, if and only if the input (x,
Benny Applebaum +1 more
semanticscholar +1 more source
Simplex Inter-IC for Wearables and Its Applications
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

