An improved protocol for ExactlyN with more than 3 players

Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif +2

The ExactlyN problem in the number-on-forehead (NOF) communication setting asks $k$ players, each of whom can see every input but their own, if the $k$ input numbers add up to $N$.…