A note on Boolean matrix multiplication
From MaRDI portal
'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.
Recommendations
Cites work
Cited in
(9)- An improved algorithm for Boolean matrix multiplication
- A practical algorithm for Boolean matrix multiplication
- Witnesses for Boolean matrix multiplication and for transitive closure
- scientific article; zbMATH DE number 3917556 (Why is no real title available?)
- scientific article; zbMATH DE number 1979525 (Why is no real title available?)
- N latency 2N I/O‐bandwidth 2D‐array matrix multiplication algorithm
- scientific article; zbMATH DE number 1405674 (Why is no real title available?)
- A new algorithm for Boolean matrix multiplication
- scientific article; zbMATH DE number 2239274 (Why is no real title available?)
This page was built for publication: A note on Boolean matrix multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q761038)
