Choosing, agreeing, and eliminating in communication complexity

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

doi:10.1007/978-3-642-14165-2_39

Choosing, agreeing, and eliminating in communication complexity

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

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Abstract

We consider several questions inspired by the direct-sum problem in (two-party) communication complexity. In all questions, there are k fixed Boolean functions f₁,...,f_k and Alice and Bob have k inputs x₁,...,x_k and y₁,...,y_k , respectively. In the eliminate problem, Alice and Bob should output a vector σ₁,...,σ_k such that f_i (x _i ) ≠ σ_i for at least one i (i.e., their goal is to eliminate one of the 2^k output vectors); in choose, Alice and Bob should return (i,f_i (x_i, y_i )) and in agree they should return f_i (x_i, y_i ), 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 language	English
Title of host publication	Automata, Languages and Programming - 37th International Colloquium, ICALP 2010, Proceedings
Pages	451-462
Number of pages	12
Edition	PART 1
DOIs	https://doi.org/10.1007/978-3-642-14165-2_39
State	Published - 12 Aug 2010
Event	37th International Colloquium on Automata, Languages and Programming, ICALP 2010 - Bordeaux, France Duration: 6 Jul 2010 → 10 Jul 2010

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number	PART 1
Volume	6198 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	37th International Colloquium on Automata, Languages and Programming, ICALP 2010
Country/Territory	France
City	Bordeaux
Period	6/07/10 → 10/07/10

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

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

Cite this

Beimel, A., Ben Daniel, S., Kushilevitz, E., & Weinreb, E. (2010). Choosing, agreeing, and eliminating in communication complexity. In Automata, Languages and Programming - 37th International Colloquium, ICALP 2010, Proceedings (PART 1 ed., pp. 451-462). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6198 LNCS, No. PART 1). https://doi.org/10.1007/978-3-642-14165-2_39

Beimel, Amos ; Ben Daniel, Sebastian ; Kushilevitz, Eyal et al. / Choosing, agreeing, and eliminating in communication complexity. Automata, Languages and Programming - 37th International Colloquium, ICALP 2010, Proceedings. PART 1. ed. 2010. pp. 451-462 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1).

@inproceedings{aac84f9ed1204c38ba50bf3a05c76576,

title = "Choosing, agreeing, and eliminating in communication complexity",

abstract = "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.",

author = "Amos Beimel and {Ben Daniel}, Sebastian and Eyal Kushilevitz and Enav Weinreb",

year = "2010",

month = aug,

day = "12",

doi = "10.1007/978-3-642-14165-2_39",

language = "English",

isbn = "3642141641",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

number = "PART 1",

pages = "451--462",

booktitle = "Automata, Languages and Programming - 37th International Colloquium, ICALP 2010, Proceedings",

edition = "PART 1",

note = "37th International Colloquium on Automata, Languages and Programming, ICALP 2010 ; Conference date: 06-07-2010 Through 10-07-2010",

}

Beimel, A, Ben Daniel, S, Kushilevitz, E & Weinreb, E 2010, Choosing, agreeing, and eliminating in communication complexity. in Automata, Languages and Programming - 37th International Colloquium, ICALP 2010, Proceedings. PART 1 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 1, vol. 6198 LNCS, pp. 451-462, 37th International Colloquium on Automata, Languages and Programming, ICALP 2010, Bordeaux, France, 6/07/10. https://doi.org/10.1007/978-3-642-14165-2_39

Choosing, agreeing, and eliminating in communication complexity. / Beimel, Amos; Ben Daniel, Sebastian; Kushilevitz, Eyal et al.
Automata, Languages and Programming - 37th International Colloquium, ICALP 2010, Proceedings. PART 1. ed. 2010. p. 451-462 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6198 LNCS, No. PART 1).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Choosing, agreeing, and eliminating in communication complexity

AU - Beimel, Amos

AU - Ben Daniel, Sebastian

AU - Kushilevitz, Eyal

AU - Weinreb, Enav

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 -

Beimel A, Ben Daniel S, Kushilevitz E, Weinreb E. Choosing, agreeing, and eliminating in communication complexity. In Automata, Languages and Programming - 37th International Colloquium, ICALP 2010, Proceedings. PART 1 ed. 2010. p. 451-462. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1). doi: 10.1007/978-3-642-14165-2_39

Choosing, agreeing, and eliminating in communication complexity

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this