Communication is bounded by root of rank

DOI10.1145/2591796.2591799MaRDI QIDQ6829235zbMATH OpenFDO

Authors Shachar Lovett

Publication date 26 June 2015

Published in Proceedings of the forty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

zbMATH Keywords

communication complexitylog rank conjecture

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15)

This page was built for publication: Communication is bounded by root of rank

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