Communication complexity and linearly ordered sets
Abstract
The paper is devoted to the communication complexity of lattice operations in linearly ordered finite sets. All well known techniques ([4, Chapter 1]) to determine the communication complexity of the infimum function in linear lattices disappoint, because a gap between the lower and upper bound is equal to 𝓞(log2n), where n is the cardinality of the lattice. Therefore our aim will be to investigate the communication complexity of the function more carefully. We consider a family of so called interval protocols and we construct the interval protocols for the infimum. We prove that the constructed protocols are optimal in the family of interval protocols. It is still open problem to compute the communication complexity of constructed protocols but the numerical experiments show that their complexity is less than the complexity of known protocols for the infimum function.
Keywords
communication complexity; linear lattice; communication protocol; interval protocol
References
2. Babaioff M., Blumrosen L., Naor M., Schapira M., Informational overhead of incentive compatibility, in: Proc. 9th ACM Conference on Electronic Commerce, ACM, 2008, pp. 88–97.
3. Björner A., Kalander J., Lindström B., Communication complexity of two decision problems, Discrete Appl. Math. 39 (1992), 161–163.
4. Kushilevitz E., Nisan N., Communication complexity, Cambridge University Press, Cambridge, 1997.
5. Lovasz L., Sachs M., Communication complexity and combinatorial lattice theory, J. Comput. System Sci. 47 (1993), 322–349.
6. Mehlhorn K., Schmidt E., Las Vegas is better than determinism in VLSI and distributed computing, in: Proc. 14th Ann. ACM Symp. on Theory of Computing, ACM, 1982, pp. 330–337.
7. Serwecińska M., Communication complexity in linear ordered sets, Bull. Sect. Logic 33 (2004), no. 4, 209–222.
8. Yao A.C., Some complexity questions related to distributive computing, in: Proc. 11th Ann. ACM Symp. on Theory of Computing, ACM, 1979, pp. 209–213.
Instytut Matematyki, Uniwersytet Śląski w Katowicach Poland
Instytut Matematyki, Uniwersytet Śląski w Katowicach Poland
The Copyright Holders of the submitted text are the Author and the Journal. The Reader is granted the right to use the pdf documents under the provisions of the Creative Commons 4.0 International License: Attribution (CC BY). The user can copy and redistribute the material in any medium or format and remix, transform, and build upon the material for any purpose.
- License
This journal provides immediate open access to its content under the Creative Commons BY 4.0 license (http://creativecommons.org/licenses/by/4.0/). Authors who publish with this journal retain all copyrights and agree to the terms of the above-mentioned CC BY 4.0 license. - Author’s Warranties
The author warrants that the article is original, written by stated author/s, has not been published before, contains no unlawful statements, does not infringe the rights of others, is subject to copyright that is vested exclusively in the author and free of any third party rights, and that any necessary written permissions to quote from other sources have been obtained by the author/s. - User Rights
Under the Creative Commons Attribution license, the users are free to share (copy, distribute and transmit the contribution) and adapt (remix, transform, and build upon the material) the article for any purpose, provided they attribute the contribution in the manner specified by the author or licensor. - Co-Authorship
If the article was prepared jointly with other authors, the signatory of this form warrants that he/she has been authorized by all co-authors to sign this agreement on their behalf, and agrees to inform his/her co-authors of the terms of this agreement.
