eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2005-03-24
1
14
10.4230/DagSemProc.04421.6
article
The communication complexity of the Exact-N Problem revisited
Gasarch, William
Glenn, James
Utis, Andre
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.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol04421/DagSemProc.04421.6/DagSemProc.04421.6.pdf
Communication Complexity
Exact-N problem
Arithmetic Sequences