A Study on the Efficient Multiplication with All m$\times$k Boolean Matrices

모든 m$\times$k 불리언 행렬과의 효율적 곱셈에 관한 연구

  • Published : 2006.02.01

Abstract

Boolean matrices are applied to a variety of areas and used successfully in many applications, and there are many researches on boolean matrices. Most researches deal with the multiplication of boolean matrices, but all of them focus on the multiplication of two boolean matrices and very few researches deal with the multiplication between many n$\times$m boolean matrices and all m$\times$k boolean matrices. The paper discusses the existing optimal algorithms for the multiplication of two boolean matrices are not suitable for the multiplication between a n$\times$m boolean matrix and all m$\times$k boolean matrices, establishes a theory that enables the efficient multiplication of a n$\times$m boolean matrix and all m$\times$k boolean matrices, and shows the execution results of a multiplication algorithm designed with this theory.

Keywords

Boolean Matrix;Matrix Multiplication;Algorithm;NP-Complete;Computational Complexity