Information complexity of the AND function in the two-party and multi-party settings

Yuval Filmus; Hamed Hatami; Yaqiao Li; Suzin You

doi:https://doi.org/10.1007/978-3-319-62389-4_17

Information complexity of the AND function in the two-party and multi-party settings

Yuval Filmus, Hamed Hatami, Yaqiao Li, Suzin You

Computer Science

Technion - Israel Institute of Technology

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

Abstract

In a recent breakthrough paper [M. Braverman, A. Garg, D. Pankratov, and O. Weinstein, From information to exact communication, STOC’13] Braverman et al. developed a local characterization for the zero-error information complexity in the two-party model, and used it to compute the exact internal and external information complexity of the 2-bit AND function. In this article, we extend their results on AND function to the multi-party number-in-hand model by proving that the generalization of their protocol has optimal internal and external information cost for certain distributions. Our proof has new components, and in particular it fixes a minor gap in the proof of Braverman et al.

Original language	English
Title of host publication	Computing and Combinatorics - 23rd International Conference, COCOON 2017, Proceedings
Editors	Yixin Cao, Jianer Chen
Pages	200-211
Number of pages	12
DOIs	https://doi.org/10.1007/978-3-319-62389-4_17
State	Published - 2017
Event	23rd International Conference on Computing and Combinatorics, COCOON 2017 - Hong Kong, China Duration: 3 Aug 2017 → 5 Aug 2017

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	10392 LNCS

Conference

Conference	23rd International Conference on Computing and Combinatorics, COCOON 2017
Country/Territory	China
City	Hong Kong
Period	3/08/17 → 5/08/17

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

https://doi.org/10.1007/978-3-319-62389-4_17

Cite this

Filmus, Y., Hatami, H., Li, Y., & You, S. (2017). Information complexity of the AND function in the two-party and multi-party settings. In Y. Cao, & J. Chen (Eds.), Computing and Combinatorics - 23rd International Conference, COCOON 2017, Proceedings (pp. 200-211). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10392 LNCS). https://doi.org/10.1007/978-3-319-62389-4_17

Filmus, Yuval ; Hatami, Hamed ; Li, Yaqiao et al. / Information complexity of the AND function in the two-party and multi-party settings. Computing and Combinatorics - 23rd International Conference, COCOON 2017, Proceedings. editor / Yixin Cao ; Jianer Chen. 2017. pp. 200-211 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{b213c16bc219428e9bb64d765f52f1f9,

title = "Information complexity of the AND function in the two-party and multi-party settings",

abstract = "In a recent breakthrough paper [M. Braverman, A. Garg, D. Pankratov, and O. Weinstein, From information to exact communication, STOC{\textquoteright}13] Braverman et al. developed a local characterization for the zero-error information complexity in the two-party model, and used it to compute the exact internal and external information complexity of the 2-bit AND function. In this article, we extend their results on AND function to the multi-party number-in-hand model by proving that the generalization of their protocol has optimal internal and external information cost for certain distributions. Our proof has new components, and in particular it fixes a minor gap in the proof of Braverman et al.",

author = "Yuval Filmus and Hamed Hatami and Yaqiao Li and Suzin You",

note = "Publisher Copyright: {\textcopyright} 2017, Springer International Publishing AG.; 23rd International Conference on Computing and Combinatorics, COCOON 2017 ; Conference date: 03-08-2017 Through 05-08-2017",

year = "2017",

doi = "https://doi.org/10.1007/978-3-319-62389-4_17",

language = "الإنجليزيّة",

isbn = "9783319623887",

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

pages = "200--211",

editor = "Yixin Cao and Jianer Chen",

booktitle = "Computing and Combinatorics - 23rd International Conference, COCOON 2017, Proceedings",

}

Filmus, Y, Hatami, H, Li, Y & You, S 2017, Information complexity of the AND function in the two-party and multi-party settings. in Y Cao & J Chen (eds), Computing and Combinatorics - 23rd International Conference, COCOON 2017, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10392 LNCS, pp. 200-211, 23rd International Conference on Computing and Combinatorics, COCOON 2017, Hong Kong, China, 3/08/17. https://doi.org/10.1007/978-3-319-62389-4_17

Information complexity of the AND function in the two-party and multi-party settings. / Filmus, Yuval; Hatami, Hamed; Li, Yaqiao et al.
Computing and Combinatorics - 23rd International Conference, COCOON 2017, Proceedings. ed. / Yixin Cao; Jianer Chen. 2017. p. 200-211 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10392 LNCS).

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

TY - GEN

T1 - Information complexity of the AND function in the two-party and multi-party settings

AU - Filmus, Yuval

AU - Hatami, Hamed

AU - Li, Yaqiao

AU - You, Suzin

PY - 2017

Y1 - 2017

N2 - In a recent breakthrough paper [M. Braverman, A. Garg, D. Pankratov, and O. Weinstein, From information to exact communication, STOC’13] Braverman et al. developed a local characterization for the zero-error information complexity in the two-party model, and used it to compute the exact internal and external information complexity of the 2-bit AND function. In this article, we extend their results on AND function to the multi-party number-in-hand model by proving that the generalization of their protocol has optimal internal and external information cost for certain distributions. Our proof has new components, and in particular it fixes a minor gap in the proof of Braverman et al.

AB - In a recent breakthrough paper [M. Braverman, A. Garg, D. Pankratov, and O. Weinstein, From information to exact communication, STOC’13] Braverman et al. developed a local characterization for the zero-error information complexity in the two-party model, and used it to compute the exact internal and external information complexity of the 2-bit AND function. In this article, we extend their results on AND function to the multi-party number-in-hand model by proving that the generalization of their protocol has optimal internal and external information cost for certain distributions. Our proof has new components, and in particular it fixes a minor gap in the proof of Braverman et al.

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

U2 - https://doi.org/10.1007/978-3-319-62389-4_17

DO - https://doi.org/10.1007/978-3-319-62389-4_17

M3 - منشور من مؤتمر

SN - 9783319623887

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

SP - 200

EP - 211

BT - Computing and Combinatorics - 23rd International Conference, COCOON 2017, Proceedings

A2 - Cao, Yixin

A2 - Chen, Jianer

T2 - 23rd International Conference on Computing and Combinatorics, COCOON 2017

Y2 - 3 August 2017 through 5 August 2017

ER -

Filmus Y, Hatami H, Li Y, You S. Information complexity of the AND function in the two-party and multi-party settings. In Cao Y, Chen J, editors, Computing and Combinatorics - 23rd International Conference, COCOON 2017, Proceedings. 2017. p. 200-211. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: https://doi.org/10.1007/978-3-319-62389-4_17

Information complexity of the AND function in the two-party and multi-party settings

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this