Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Communication Complexity And Linearly Ordered Sets

100%

Kula M., Serwecińska M.

Annales Mathematicae Silesianae

2015

tom 29

nr 1

93-117

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.

Ograniczanie wyników

1 Annales Mathematicae Silesianae

1 Kula M.

1 Serwecińska M.

1 2015

Wyniki wyszukiwania

Communication Complexity And Linearly Ordered Sets