Carleton University
Technical Report TR-116
June 1987
A Practical Algorithm for Boolean Matrix Multiplication
M.D. Atkinson & N. Santoro
Abstract
An algorithm is given for multiplying two nxn Boolean matrices. It has time complexity O(n3/(log n)l .5) and requires n log2n bits of auxiliary storage.