arXiv stat.ML
· Papers
Tight Information Complexity of the Coin Problem in the Broadcast Model
arXiv:2608.02776v1 Announce Type: cross Abstract: 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 to universal constant factors the information complexity under either hypothesis