Grocery on Distributed Algorithms

C1: Communication Complexity of Disjointness using Entropy Theory

Reminder: This post contains 98 words · 1 min read · by Xianbin

In this post, we use entropy theory to prove the lower bound for DISJ.


\(\color{red} \text{To be continued \ldots}\)