A note on Boolean matrix multiplication (Q761038)

'Almost all' known Boolean matrix multiplication algorithms are considered as an extension of algorithms for general matrix multiplication. \textit{N. Santoro} [Numer. Math. Comput., Proc. 10th Manitoba Conf., 1980, Congr. Numerantium 31, 241-251 (1981; Zbl 0507.68023)] presented \(O(n^ 2)\) algorithms under the assumption that one of the matrices is sparse or dense. In the present paper we introduce a notion of 'interval sparsity' of Boolean matrices and then we show an application of this notion to Boolean matrix multplication.