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

Yuval Filmus, Hamed Hatami, Yaqiao Li, Suzin You

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

3 Scopus citations

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 languageEnglish
Title of host publicationComputing and Combinatorics - 23rd International Conference, COCOON 2017, Proceedings
EditorsYixin Cao, Jianer Chen
Pages200-211
Number of pages12
DOIs
StatePublished - 2017
Event23rd International Conference on Computing and Combinatorics, COCOON 2017 - Hong Kong, China
Duration: 3 Aug 20175 Aug 2017

Publication series

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

Conference

Conference23rd International Conference on Computing and Combinatorics, COCOON 2017
Country/TerritoryChina
CityHong Kong
Period3/08/175/08/17

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Information complexity of the AND function in the two-party and multi-party settings'. Together they form a unique fingerprint.

Cite this