A note on Boolean matrix multiplication (Q761038)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3887068
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on Boolean matrix multiplication |
scientific article; zbMATH DE number 3887068 |
Statements
A note on Boolean matrix multiplication (English)
0 references
1984
0 references
'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.
0 references
interval tree
0 references
interval sparsity
0 references
0.8118749856948853
0 references
0.7954941987991333
0 references
0.7930576205253601
0 references
0.7770265936851501
0 references
