Results 1 to 10 of about 5,642,848 (291)
Separations in Communication Complexity Using Cheat Sheets and Information Complexity [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2016 While exponential separations are known between quantum and randomized communication complexity for partial functions (Raz, STOC 1999), the best known separation between these measures for a total function is quadratic, witnessed by the disjointness ...
Anurag Anshu +7 more
semanticscholar +1 more source
Distribution Testing Lower Bounds via Reductions from Communication Complexity
Cybersecurity and Cyberforensics Conference, 2019 We present a new methodology for proving distribution testing lower bounds, establishing a connection between distribution testing and the simultaneous message passing (SMP) communication model.
Eric Blais, C. Canonne, Tom Gur
semanticscholar +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
Communication Complexity of Collision
Electron. Colloquium Comput. Complex., 2022 The Collision problem is to decide whether a given list of numbers $(x_1,\ldots,x_n)\in[n]^n$ is $1$-to-$1$ or $2$-to-$1$ when promised one of them is the case. We show an $n^{Ω(1)}$ randomised communication lower bound for the natural two-party version of Collision where Alice holds the first half of the bits of each $x_i$ and Bob holds the second ...
Mika Göös, Siddhartha Jain 0002
openaire +5 more sources
Communication Complexity (for Algorithm Designers) [PDF]
Foundations and Trends® in Theoretical Computer Science, 2015 This document collects the lecture notes from my course "Communication Complexity (for Algorithm Designers),'' taught at Stanford in the winter quarter of 2015. The two primary goals of the course are: 1. Learn several canonical problems that have proved
Tim Roughgarden
semanticscholar +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
Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of Disjointness [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2015 We prove a near optimal round-communication tradeoff for the two-party quantum communication complexity of disjointness. For protocols with r rounds, we prove a lower bound of Omega(n/r) on the communication required for computing disjointness of input ...
M. Braverman +4 more
semanticscholar +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
Food-web complexity, meta-community complexity and community stability [PDF]
Scientific Reports, 2016 Abstract What allows interacting, diverse species to coexist in nature has been a central question in ecology, ever since the theoretical prediction that a complex community should be inherently unstable. Although the role of spatiality in species coexistence has been recognized, its application to more complex systems has been less ...
A. Mougi, M. Kondoh
openaire +2 more sources
Infinite Communication Complexity
CoRR, 2014 Suppose that Alice and Bob are given each an infinite string, and they want to decide whether their two strings are in a given relation. How much communication do they need? How can communication be even defined and measured for infinite strings? In this article, we propose a formalism for a notion of infinite communication complexity, prove that it ...
Guillon, Pierre, Jeandel, Emmanuel
openaire +3 more sources