Algebraic techniques in communication complexity

DOI10.1016/0020-0190(95)00158-9zbMath0875.68549OpenAlexW2026225390MaRDI QIDQ1350289

Luciano Margara, Bruno Codenotti, Giovanni Manzini

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00158-9

zbMATH Keywords

Computational complexityCommunication complexityGapRank of a matrix

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (1)

Matrix rank and communication complexity

Cites Work

• A combinatorial approach to complexity
• Communication in bounded depth circuits
• On rank vs. communication complexity
• On the ``log rank-conjecture in communication complexity
• Maximum Rank of Powers of a Matrix of a Given Pattern
• Modified ranks of tensors and the size of circuits

This page was built for publication: Algebraic techniques in communication complexity