Communication complexity and linearly ordered sets

DOI10.1515/AMSIL-2015-0008MaRDI QIDQ2363626zbMATH OpenOpenAlexFDO

Authors Małgorzata Serwecińska, Mieczysław Kula

Publication date 25 July 2017

Published in Annales Mathematicae Silesianae (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://doi.org/10.1515/amsil-2015-0008

zbMATH Keywords

communication complexitycommunication protocollinear latticeinterval protocol

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Total orders (06A05)

Recommendations

• scientific article; zbMATH DE number 2170852
• Communication complexity in lattices
• Deterministic communication complexity of set intersection
• The communication complexity of interval orders
• scientific article; zbMATH DE number 4147508

Cites work

• scientific article; zbMATH DE number 2170852 (Why is no real title available?)
• Communication Complexity
• Communication complexity and combinatorial lattice theory
• Communication complexity in lattices
• Communication complexity of two decision problems

Cited in

(3)

• scientific article; zbMATH DE number 2170852 (Why is no real title available?)
• Some order dimension bounds for communication complexity problems
• The communication complexity of interval orders

This page was built for publication: Communication complexity and linearly ordered sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2363626)