Zobrazeno 1 - 10
of 865
pro vyhledávání: '"Set Disjointness"'
Autor:
Yang, Guangxu, Zhang, Jiapeng
Set-disjointness problems are one of the most fundamental problems in communication complexity and have been extensively studied in past decades. Given its importance, many lower bound techniques were introduced to prove communication lower bounds of
Externí odkaz:
http://arxiv.org/abs/2309.13517
Autor:
Lovett, Shachar, Zhang, Jiapeng
Frequency estimation in data streams is one of the classical problems in streaming algorithms. Following much research, there are now almost matching upper and lower bounds for the trade-off needed between the number of samples and the space complexi
Externí odkaz:
http://arxiv.org/abs/2301.05658
The multiplayer promise set disjointness is one of the most widely used problems from communication complexity in applications. In this problem there are $k$ players with subsets $S^1, \ldots, S^k$, each drawn from $\{1, 2, \ldots, n\}$, and we are p
Externí odkaz:
http://arxiv.org/abs/2105.11338
Autor:
Magniez, Frederic, Nayak, Ashwin
Publikováno v:
ACM Transactions on Computation Theory, Volume 14, Issue 1, March 2022, Article No.: 5, pp 1-22
Set Disjointness on a Line is a variant of the Set Disjointness problem in a distributed computing scenario with $d+1$ processors arranged on a path of length $d$. It was introduced by Le Gall and Magniez (PODC 2018) for proving lower bounds on the q
Externí odkaz:
http://arxiv.org/abs/2002.11795
We study the Convex Set Disjointness (CSD) problem, where two players have input sets taken from an arbitrary fixed domain~$U\subseteq \mathbb{R}^d$ of size $\lvert U\rvert = n$. Their mutual goal is to decide using minimum communication whether the
Externí odkaz:
http://arxiv.org/abs/1909.03547
In the SetDisjointness problem, a collection of $m$ sets $S_1,S_2,...,S_m$ from some universe $U$ is preprocessed in order to answer queries on the emptiness of the intersection of some two query sets from the collection. In the SetIntersection varia
Externí odkaz:
http://arxiv.org/abs/1910.00831
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
A basic goal in complexity theory is to understand the communication complexity of number-on-the-forehead problems $f\colon(\{0,1\}^n)^{k}\to\{0,1\}$ with $k\gg\log n$ parties. We study the problems of inner product and set disjointness and determine
Externí odkaz:
http://arxiv.org/abs/1711.10661
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
In a multiparty message-passing model of communication, there are $k$ players. Each player has a private input, and they communicate by sending messages to one another over private channels. While this model has been used extensively in distributed c
Externí odkaz:
http://arxiv.org/abs/1305.4696