Tight Information Complexity of the Coin Problem in the Broadcast Model

Hadi Kazemi, Varun Jog

We study distributed testing of $\mathrm{Ber}(\alpha )$ versus $\mathrm{Ber}(\beta )$ in the broadcast, or shared-blackboard, model. For protocols with constant advantage, we characterise up…