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

Yuval Filmus; Hamed Hatami; Yaqiao Li; Suzin You

doi:10.1007/s00453-018-0484-8

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

Yuval Filmus, Hamed Hatami, Yaqiao Li, Suzin You

Technion - Israel Institute of Technology

Research output: Contribution to journal › Article › peer-review

Abstract

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 language	English
Pages (from-to)	4200-4237
Number of pages	38
Journal	Algorithmica
Volume	81
Issue number	11-12
DOIs	https://doi.org/10.1007/s00453-018-0484-8
State	Published - 1 Nov 2019

Keywords

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

All Science Journal Classification (ASJC) codes

General Computer Science
Applied Mathematics
Computer Science Applications

Access to Document

10.1007/s00453-018-0484-8

Cite this

@article{268f849535fe4a0dbc47d5fa52757092,

title = "Information Complexity of the AND Function in the Two-Party and Multi-party Settings",

abstract = "In a recent breakthrough paper Braverman et al. (in: STOC{\textquoteright}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.",

keywords = "AND function, Concavity condition, Information complexity, Multi-party number-in-hand model",

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

note = "Publisher Copyright: {\textcopyright} 2018, Springer Science+Business Media, LLC, part of Springer Nature.",

year = "2019",

month = nov,

day = "1",

doi = "10.1007/s00453-018-0484-8",

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

volume = "81",

pages = "4200--4237",

journal = "Algorithmica",

issn = "0178-4617",

publisher = "Springer New York",

number = "11-12",

}

TY - JOUR

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 - 2019/11/1

Y1 - 2019/11/1

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

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

KW - AND function

KW - Concavity condition

KW - Information complexity

KW - Multi-party number-in-hand model

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

U2 - 10.1007/s00453-018-0484-8

DO - 10.1007/s00453-018-0484-8

M3 - مقالة

SN - 0178-4617

VL - 81

SP - 4200

EP - 4237

JO - Algorithmica

JF - Algorithmica

IS - 11-12

ER -

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

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Cite this