TY - GEN

T1 - Choosing, agreeing, and eliminating in communication complexity

AU - Beimel, Amos

AU - Ben Daniel, Sebastian

AU - Kushilevitz, Eyal

AU - Weinreb, Enav

N1 - Funding Information:
The first author is supported by ISF grant 938/09. The second author is partially supported by the Frankel Center for Computer Science. The third and fourth authors are supported by ISF grant 1310/06.

PY - 2010/8/12

Y1 - 2010/8/12

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=77955316454&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-14165-2_39

DO - 10.1007/978-3-642-14165-2_39

M3 - Conference contribution

AN - SCOPUS:77955316454

SN - 3642141641

SN - 9783642141645

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 451

EP - 462

BT - Automata, Languages and Programming - 37th International Colloquium, ICALP 2010, Proceedings

T2 - 37th International Colloquium on Automata, Languages and Programming, ICALP 2010

Y2 - 6 July 2010 through 10 July 2010

ER -