A practical algorithm for Boolean matrix multiplication
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.
scientific article; zbMATH DE number 4076614