http://hdl.handle.net/20.500.12128/4930
Tytuł: | Communication complexity and linearly ordered sets |
Autor: | Kula, Mieczysław Serwecińska, Małgorzata |
Słowa kluczowe: | Communication complexity; Linear lattice; Communication protocol; Interval protocol |
Data wydania: | 2015 |
Źródło: | Annales Mathematicae Silesianae, Nr 29 (2015), s. 93-117 |
Abstrakt: | 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. |
URI: | http://hdl.handle.net/20.500.12128/4930 |
DOI: | 10.1515/amsil-2015-0008 |
ISSN: | 0860-2107 2391-4238 |
Pojawia się w kolekcji: | Artykuły (WNŚiT) |
Plik | Opis | Rozmiar | Format | |
---|---|---|---|---|
Kula_Communication_complexity_and_linearly_ordered_sets.pdf | 766,48 kB | Adobe PDF | Przejrzyj / Otwórz |
Uznanie autorstwa - użycie niekomercyjne, bez utworów zależnych 3.0 Polska Creative Commons