DC pole | Wartość | Język |
dc.contributor.author | Kula, Mieczysław | - |
dc.contributor.author | Serwecińska, Małgorzata | - |
dc.date.accessioned | 2018-06-26T05:52:48Z | - |
dc.date.available | 2018-06-26T05:52:48Z | - |
dc.date.issued | 2015 | - |
dc.identifier.citation | Annales Mathematicae Silesianae, Nr 29 (2015), s. 93-117 | pl_PL |
dc.identifier.issn | 0860-2107 | - |
dc.identifier.issn | 2391-4238 | - |
dc.identifier.uri | http://hdl.handle.net/20.500.12128/4930 | - |
dc.description.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. | pl_PL |
dc.language.iso | en | pl_PL |
dc.rights | Uznanie autorstwa-Użycie niekomercyjne-Bez utworów zależnych 3.0 Polska | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/pl/ | * |
dc.subject | Communication complexity | pl_PL |
dc.subject | Linear lattice | pl_PL |
dc.subject | Communication protocol | pl_PL |
dc.subject | Interval protocol | pl_PL |
dc.title | Communication complexity and linearly ordered sets | pl_PL |
dc.type | info:eu-repo/semantics/article | pl_PL |
dc.identifier.doi | 10.1515/amsil-2015-0008 | - |
Pojawia się w kolekcji: | Artykuły (WNŚiT)
|