The communication complexity of the Exact-N Problem revisited
If Alice has x, y, Bob has x, z and Carol has y, z can they determine if x+y+z=N? They can if (say) Alice broadcasts x to Bob and Carol; can they do better? Chandra, Furst, and Lipton studied this problem and showed sublinear upper bounds.
They also had matching (up to an additive constant) lower bounds. We give an exposition of their result with some attention to what happens for particular values of N.
Communication Complexity
Exact-N problem
Arithmetic Sequences
1-14
Regular Paper
William
Gasarch
William Gasarch
James
Glenn
James Glenn
Andre
Utis
Andre Utis
10.4230/DagSemProc.04421.6
Creative Commons Attribution 4.0 International license
https://creativecommons.org/licenses/by/4.0/legalcode