Information Complexity of the AND Function in the Two-Party and Multi-party Settings

Yuval Filmus, Hamed Hatami, Yaqiao Li, Suzin You

Research output: Contribution to journalArticlepeer-review


In a recent breakthrough paper Braverman et al. (in: STOC’13, pp 151–160, 2013) 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 natural distributions. Our proof has new components, and in particular, it fixes a minor gap in the proof of Braverman et al.

Original languageEnglish
Pages (from-to)4200-4237
Number of pages38
Issue number11-12
StatePublished - 1 Nov 2019


  • AND function
  • Concavity condition
  • Information complexity
  • Multi-party number-in-hand model

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Computer Science Applications
  • Applied Mathematics


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