PublicationsPapers

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

Yuval Filmus, Hamed Hatami, Yaqiao Li and Suzin You

COCOON'17, Algorithmica

We find the optimal protocol (from the point of view of information complexity) for the AND function in a multiparty setting, extending the buzzer protocol described by Braverman et al.

We also fill in some gaps in the arguments of Braverman et al.

BibTeX

@inproceedings{FHLY2017,
author = {Yuval Filmus and Hamed Hatami and Yaqiao Li and Suzin You},
title = {Information complexity of the {AND} function in the two-party, and multiparty settings},
booktitle = {23rd annual international computing and combinatorics conference (COCOON'17)},
year = {2017}
}
@article{FHLY2019,
author = {Yuval Filmus and Hamed Hatami and Yaqiao Li and Suzin You},
title = {Information complexity of the {AND} function in the two-party, and multiparty settings},
journal = {Algorithmica},
volume = {81},
number = {11--12},
pages = {4200--4237},
year = {2019}
}

copy to clipboard

back to index