Jump to ContentJump to Main Navigation
Show Summary Details
More options …

Annales Mathematicae Silesianae

Editor-in-Chief: Sablik, Maciej

1 Issue per year


Mathematical Citation Quotient (MCQ) 2016: 0.10

Open Access
Online
ISSN
2391-4238
See all formats and pricing
More options …

Communication Complexity And Linearly Ordered Sets

Mieczysław Kula / Małgorzata Serwecińska
Published Online: 2015-09-30 | DOI: https://doi.org/10.1515/amsil-2015-0008

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 O(log2 n), 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.

(2010) Mathematics Subject Classification:: 68Q17; 68Q25

Key words and phrases:: communication complexity; linear lattice; communication protocol; interval protocol

References

  • [1] Ahlswede R., Cai N., Tamm U., Communication complexity in lattices, Appl. Math. Lett. 6 (1993), no. 6, 53–58.CrossrefGoogle Scholar

  • [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.Google Scholar

  • [3] Björner A., Kalander J., Lindström B., Communication complexity of two decision problems, Discrete Appl. Math. 39 (1992), 161–163.Google Scholar

  • [4] Kushilevitz E., Nisan N., Communication complexity, Cambridge University Press, Cambridge, 1997.Google Scholar

  • [5] Lovasz L., Sachs M., Communication complexity and combinatorial lattice theory, J. Comput. System Sci. 47 (1993), 322–349.Google Scholar

  • [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.Google Scholar

  • [7] Serwecińska M., Communication complexity in linear ordered sets, Bull. Sect. Logic 33 (2004), no. 4, 209–222.Google Scholar

  • [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.Google Scholar

About the article

Received: 2014-07-24

Revised: 2015-03-21

Published Online: 2015-09-30

Published in Print: 2015-09-01


Citation Information: Annales Mathematicae Silesianae, Volume 29, Issue 1, Pages 93–117, ISSN (Online) 0860-2107, DOI: https://doi.org/10.1515/amsil-2015-0008.

Export Citation

© Mieczysław Kula et al.. This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License. BY-NC-ND 3.0

Comments (0)

Please log in or register to comment.
Log in