Algebraic techniques in communication complexity

DOI10.1016/0020-0190(95)00158-9MaRDI QIDQ1350289zbMATH OpenOpenAlexFDO

Authors Bruno Codenotti, Giovanni Manzini, Luciano Margara

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)

Recommendations

• Linear algebraic methods in communication complexity
• Complexity Lower Bounds using Linear Algebra
• On rank vs. communication complexity
• On the ``log rank-conjecture in communication complexity

Cites work

• {{#invoke:WikidataIB|getLink|Q1196691}} A combinatorial approach to complexity
• {{#invoke:WikidataIB|getLink|Q1330798}} Communication in bounded depth circuits
• {{#invoke:WikidataIB|getLink|Q3470496}} Maximum Rank of Powers of a Matrix of a Given Pattern
• {{#invoke:WikidataIB|getLink|Q5248522}} Modified ranks of tensors and the size of circuits
• {{#invoke:WikidataIB|getLink|Q1906852}} On rank vs. communication complexity
• {{#invoke:WikidataIB|getLink|Q1906853}} On the ``log rank-conjecture in communication complexity

Cited in

(6)

• Communication complexity and combinatorial lattice theory
• Linear algebraic methods in communication complexity
• Complexity Lower Bounds using Linear Algebra
• scientific article; zbMATH DE number 6308216 (Why is no real title available?)
• Matrix rank and communication complexity
• scientific article; zbMATH DE number 1223708 (Why is no real title available?)

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

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