Results 41 to 50 of about 423,241 (305)
A Note on the LogRank Conjecture in Communication Complexity
Mathematics, 2023 The LogRank conjecture of Lovász and Saks (1988) is the most famous open problem in communication complexity theory. The statement is as follows: suppose that two players intend to compute a Boolean function f(x,y) when x is known for the first and y for
Vince Grolmusz
doaj +1 more source
Probabilistic Communication Complexity
25th Annual Symposium onFoundations of Computer Science, 1984., 1986 Communication is a bottleneck in many distributed computations. In VLSI, communication constraints dictate lower bounds on the performance of chips. The two-processor information transfer model measures the communication requirements to compute functions. We study the unbounded error probabilistic version of this model.
Ramamohan Paturi, Janos Simon
openaire +2 more sources
Stochastic channel model for simulation of mobile ad hoc networks
The Journal of Engineering, 2014 Channel models, applicable to mobile ad hoc network (MANET) simulations, need to be both accurate and computationally efficient. It has been shown that inaccuracies in the channel model can seriously affect various network performance measures.
Gunnar Eriksson +3 more
doaj +1 more source
Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity [PDF]
, 2006 We develop a new method for estimating the discrepancy of tensors associated with multiparty communication problems in the ``Number on the Forehead'' model of Chandra, Furst and Lipton.
Ford, Jeff, Gál, Anna
core +1 more source
On multi-partition communication complexity
Information and Computation, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pavol Duris +4 more
openaire +3 more sources
Multiparty Quantum Communication Complexity of Triangle Finding [PDF]
, 2018 Triangle finding (deciding if a graph contains a triangle or not) is a central problem in quantum query complexity. The quantum communication complexity of this problem, where the edges of the graph are distributed among the players, was considered ...
Le Gall, François, Nakajima, Shogo
core +1 more source
The Communication Complexity of Optimization [PDF]
, 2020 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 subset $A^{(i)} x = b^{(i)}$ of $n_i$ constraints of a linear system in $d$ variables, and the ...
Santosh S. Vempala +2 more
openaire +2 more sources
Simplified Lower Bounds on the Multiparty Communication Complexity of Disjointness [PDF]
, 2014 We show that the deterministic number-on-forehead communication complexity of set disjointness for k parties on a universe of size n is Omega(n/4^k). This gives the first lower bound that is linear in n, nearly matching Grolmusz's upper bound of O(log^2 ...
Anup Rao +3 more
core +1 more source
Communication complexity of PRAMs
Theoretical Computer Science, 1990 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alok Aggarwal +2 more
openaire +1 more source
Cognitive ResearchPrior studies indicate that emotions, particularly high-arousal emotions, may elicit rapid intuitive thinking, thereby decreasing the ability to recognize misinformation. Yet, few studies have distinguished prior affective states from emotional reactions
Jula Lühring +5 more
doaj +1 more source