Communication complexity in lattices

DOI10.1016/0893-9659(93)90078-2zbMath0791.94001OpenAlexW2005638347MaRDI QIDQ1324492

Ning Cai, Ulrich Tamm

Publication date: 23 June 1994

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://pub.uni-bielefeld.de/record/1780521

zbMATH Keywords

communication complexityfinite latticeprotocols

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Vector spaces, linear dependence, rank, lineability (15A03) Communication theory (94A05)

Related Items (3)

Communication complexity and linearly ordered sets ⋮ Multiparty Communication Complexity of Vector–Valued and Sum–Type Functions ⋮ Still another rank determination of set intersection matrices with an application in communication complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Communication complexity of two decision problems
• Deterministic communication complexity of set intersection
• Whitney Number Inequalities for Geometric Lattices
• On communication complexity of vector-valued functions
• Determinants on Semilattices
• Hadamard determinants Möbius functions, and the chromatic number of a graph

This page was built for publication: Communication complexity in lattices