We study the two-player communication complexity of the \textsf{Coin} problem. Here, two players, denoted Alice and Bob, are given up to $n$ individual i.i.d. random coins, and asked to output whether there are more heads or tails. An immediate approach is for Alice to send Bob her exact numbers of heads and tails, yie...
This work proves an information-theoretically optimal gap-majority lemma in the two-player randomized communication model and makes GapMAJ, to the knowledge, only the third explicit outer gadget that admits a strong composition theorem in the two-player communication setting, following the identity and XOR gadgets.
A new $\widetilde{O}(n^{3/2})$-bit protocol for computing a maximum matching in general graphs and a new $\widetilde{O}(n)$-bit protocol for negative-cycle detection and negative-weight single-source shortest paths are introduced.
Yu Cheng, Tianle Jiang, Pachara Sawettamalya et al.· Embedded Systems and Applica...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.