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.
H. Hatami—Supported by an NSERC grant.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Barak, B., Braverman, M., Chen, X., Rao, A.: How to compress interactive communication [extended abstract]. In: STOC 2010, pp. 67–76. ACM, New York (2010)
Braverman, M., Garg, A., Pankratov, D., Weinstein, O.: From information to exact communication (extended abstract). In: STOC 2013, pp. 151–160. ACM, New York (2013)
Braverman, M., Garg, A., Pankratov, D., Weinstein, O.: Information lower bounds via self-reducibility. Theory Comput. Syst. 59(2), 377–396 (2016)
Braverman, M., Rao, A.: Information equals amortized communication. IEEE Trans. Inform. Theory 60(10), 6058–6069 (2014)
Braverman, M., Schneider, J.: Information complexity is computable, arXiv preprint arXiv:1502.02971 (2015)
Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley, New York (2012)
Dagan, Y., Filmus, Y.: Grid protocols (2016, in preparation)
Dagan, Y., Filmus, Y., Hatami, H., Li, Y.: Trading information complexity for error, arXiv preprint arXiv:1611.06650 (2016)
Gronemeier, A.: Asymptotically optimal lower bounds on the nih-multi-party information, arXiv preprint arXiv:0902.1609 (2009)
Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)
Ma, N., Ishwar, P.: Some results on distributed source coding for interactive function computation. IEEE Trans. Inform. Theory 57(9), 6180–6195 (2011)
Ma, N., Ishwar, P.: The infinite-message limit of two-terminal interactive source coding. IEEE Trans. Inform. Theory 59(7), 4071–4094 (2013)
Razborov, A.A.: On the distributional complexity of disjointness. Theoret. Comput. Sci. 106(2), 385–390 (1992)
Yao, A.C.-C.: Some complexity questions related to distributive computing (preliminary report). In: STOC 1979, pp. 209–213. ACM (1979)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Filmus, Y., Hatami, H., Li, Y., You, S. (2017). Information Complexity of the AND Function in the Two-Party and Multi-party Settings. In: Cao, Y., Chen, J. (eds) Computing and Combinatorics. COCOON 2017. Lecture Notes in Computer Science(), vol 10392. Springer, Cham. https://doi.org/10.1007/978-3-319-62389-4_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-62389-4_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-62388-7
Online ISBN: 978-3-319-62389-4
eBook Packages: Computer ScienceComputer Science (R0)