A practical algorithm for Boolean matrix multiplication (Q1111377)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A practical algorithm for Boolean matrix multiplication |
scientific article; zbMATH DE number 4076614
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A practical algorithm for Boolean matrix multiplication |
scientific article; zbMATH DE number 4076614 |
Statements
A practical algorithm for Boolean matrix multiplication (English)
0 references
1988
0 references
An algorithm is given for multiplying two \(n\times n\) Boolean matrices. It has time complexity \(O(n^ 3/(\log n)^{1.5})\) and requires n \(log_ 2 n\) bits of auxiliary storage.
0 references
Boolean matrix multiplication
0 references
time versus storage tradeoffs
0 references
