Choosing, agreeing, and eliminating in communication complexity

Amos Beimel, Sebastian Ben Daniel, Eyal Kushilevitz, Enav Weinreb

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations


We consider several questions inspired by the direct-sum problem in (two-party) communication complexity. In all questions, there are k fixed Boolean functions f1,...,fk and Alice and Bob have k inputs x1,...,xk and y1,...,yk , respectively. In the eliminate problem, Alice and Bob should output a vector σ1,...,σk such that fi (x i ) ≠ σi for at least one i (i.e., their goal is to eliminate one of the 2k output vectors); in choose, Alice and Bob should return (i,fi (xi, yi )) and in agree they should return fi (xi, yi ), for some i. The question, in each of the three cases, is whether one can do better than solving one (say, the first) instance. We study these three problems and prove various positive and negative results.

Original languageEnglish
Title of host publicationAutomata, Languages and Programming - 37th International Colloquium, ICALP 2010, Proceedings
Number of pages12
EditionPART 1
StatePublished - 12 Aug 2010
Event37th International Colloquium on Automata, Languages and Programming, ICALP 2010 - Bordeaux, France
Duration: 6 Jul 201010 Jul 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 1
Volume6198 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference37th International Colloquium on Automata, Languages and Programming, ICALP 2010


Dive into the research topics of 'Choosing, agreeing, and eliminating in communication complexity'. Together they form a unique fingerprint.

Cite this