Matrix rank and communication complexity
- 1 January 2000
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 304 (1-3) , 193-200
- https://doi.org/10.1016/s0024-3795(99)00226-8
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Boolean Circuits, Tensor Ranks, and Communication ComplexitySIAM Journal on Computing, 1997
- On the ?log rank?-conjecture in communication complexityCombinatorica, 1995
- On rank vs. communication complexityCombinatorica, 1995
- Algebraic techniques in communication complexityInformation Processing Letters, 1995
- Communication in bounded depth circuitsCombinatorica, 1994
- The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinearDiscrete Mathematics, 1992
- A counterexample to the rank‐coloring conjectureJournal of Graph Theory, 1989
- On conjectures of GraffitiDiscrete Mathematics, 1988
- Some complexity questions related to distributive computing(Preliminary Report)Published by Association for Computing Machinery (ACM) ,1979
- A Bound for the Chromatic Number of a GraphThe American Mathematical Monthly, 1976