Fast matrix multiplication by boolean RAM in linear storage

Abstract

Two-dimensional Boolean RAM (random access machine with Boolean operations and shifts) can speed the results and lower the costs that appear in performing two-dimensional computations such as matrix manipulation. This paper presents an implementation of a fast algorithm for matrix multiplication; the product of (m,m)-matrices A and B with 0 ≤ aij, bij ≤ k−1, for all 1 ≤ i,j ≤ m, is computed in 0(m·log2k (log2m + log2k)) steps in linear storage.