Still another rank determination of set intersection matrices with an application in communication complexity

DOI10.1016/0893-9659(94)90028-0zbMath0791.94002OpenAlexW2021360967WikidataQ128028658 ScholiaQ128028658MaRDI QIDQ1324468

Ulrich Tamm

Publication date: 24 May 1994

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

Full work available at URL: https://doi.org/10.1016/0893-9659(94)90028-0

zbMATH Keywords

rankcommunication complexitycharacteristic function-value matrices

Mathematics Subject Classification ID

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

Related Items (1)

Multiparty Communication Complexity of Vector–Valued and Sum–Type Functions

Cites Work

• Communication complexity in lattices
• Deterministic communication complexity of set intersection
• Two-way communication complexity of sum-type functions for one processor to be informed
• Communication Complexity of Computing the Hamming Distance

This page was built for publication: Still another rank determination of set intersection matrices with an application in communication complexity