Matrix rank and communication complexity
The central notion in communication is a protocol, which is essentially a set of rules specifying the order and the meaning of the messages sent. A protocol can be analyzed in terms of ranks of the submatrices detected as the rounds proceed. The authors present some results and open problems in the area of communication complexity and on the chromatic number of a graph in terms of the rank of a matrix.
scientific article; zbMATH DE number 1420041
scientific article