Boolean Matrix Multiplication for Highly Clustered Data on the Congested Clique
We present a protocol for the Boolean matrix product of two n×n Boolean matrices on the congested clique designed for the situation when the rows of the first matrix or the columns of the second matrix are highly clustered in the space {0,1}n. With high probability (w.h.p), it uses O~Mn+1 rounds on the congested clique with n nodes, where M is the minimum of the cost of a minimum spanning tree (MS
