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. Keywords. Communication Complexity, Exact-N problem, Arithmetic Sequences

• Type: Conference
• Year: 2004
• Where: DAGSTUHL
• Authors: William I. Gasarch, James Glenn, Andrey Utis
• Keywords: Alice Broadcasts, DAGSTUHL 2004, DAGSTUHL 2007, Lower Bounds, Sublinear Upper Bounds