Skip navigation

Please use this identifier to cite or link to this item:
Title: Communication complexity and linearly ordered sets
Authors: Kula, Mieczysław
Serwecińska, Małgorzata
Keywords: Communication complexity; Linear lattice; Communication protocol; Interval protocol
Issue Date: 2015
Citation: Annales Mathematicae Silesianae, Nr 29 (2015), s. 93-117
Abstract: The communication complexity of lattice operations in linearly ordered sets is studied. If the lattices are not geometric there is a gap between the known upper and lower bounds. New techniques for the construction of "interval protocols'' are introduced and numerical experiments show that their complexity is less than the complexity of known protocols for the infimum function.
DOI: 10.1515/amsil-2015-0008
ISSN: 0860-2107
Appears in Collections:Artykuły (WNŚiT)

Files in This Item:
File Description SizeFormat 
Kula_Communication_complexity_and_linearly_ordered_sets.pdf766,48 kBAdobe PDFView/Open
Show full item record

Uznanie autorstwa - użycie niekomercyjne, bez utworów zależnych 3.0 Polska Creative Commons License Creative Commons