A Study on the Two Consecutive Multiplications of All $l{\times}n,\;n{\times}m\;and\;m{\times}k$ Boolean Matrices

모든 $l{\times}n,\;n{\times}m,\;m{\times}k$ 불리언 행렬 사이의 중첩곱셈에 대한 연구

  • Published : 2006.05.31

Abstract

Boolean matrices have been successfully used in various areas, and many researches have been performed on them. However, almost all the researches focus on the efficient multiplication of two boolean matrices and no research has been shown to deal with the multiplication of all boolean matrices and their consecutive multiplications. The paper suggests a mathematical theory that enables the efficient consecutive multiplications of all $l{\times}n,\;n{\times}m,\;and\;m{\times}k$ boolean matrices, and discusses its computational complexity and the execution results of the consecutive multiplication algorithm based on the theory.

Keywords

References

  1. 신철규, 한재일, '그리드 컴퓨팅 환경에서의 D-클래스 계산 병렬 알고리즘', 한국정보처 리학회 춘계학술대회 논문집, 제12권, 제1호 (2005), pp.929-932
  2. 신철규, 한재일, '내부 순환문 개선을 통한 Linux 기반의 D-클래스 계산 고효율 순차 알고리즘', 한국SI학회 춘계학술대회 논문집, (2005), pp.526-531
  3. 신철규, 한재일, '공유 메모리 기반의 고성능 D-클래스 계산 병렬 알고리즘', 한국컴퓨터 종합학술대회 논문집, 제32권, 제1호(2005), pp.10-12
  4. Atkinson, D. M., N. Santoro, and J. Urrutia, 'On the integer complexity of Boolean matrix multiplication', ACM SIGACT News, Vol.18, No.1(1986), p.53 https://doi.org/10.1145/8312.8316
  5. Yelowitz, L., 'A Note on the Transitive Closure of a Boolean Matrix', ACM SIGMOD Record, Vol.25, No.2(1978), p.30
  6. Comstock, D. R., 'A note on multiplying Boolean matrices II', CACM, Vol.7, No.1 (1964), p.13 https://doi.org/10.1145/363872.363891
  7. Macii, E., 'A Discussion of Explicit Methods for Transitive Closure Computation Based on Matrix Multiplication', 29th Asilom Conference on Signals, Systems and Computers, Vol.2(1995), pp.799-801
  8. Angluin, D., 'The four Russians' algorithm for boolean matrix multiplication is optimal in its class', ACM SIGACT News, Vol.8, No.1(1976), pp.29-33 https://doi.org/10.1145/1008591.1008593
  9. Booth, K. S., 'Boolean matrix multiplication using only O (n log 2 7 log n ) bit operations', ACM SIGACT News, Vol.9, No.3(1977), p.23 https://doi.org/10.1145/1008361.1008362
  10. Rim, D. S. and J. B. Kim, 'Tables of DClasses in the semigroup B of the binary relations on a set X with n-elements', Bull. Korea Math. Soc., Vol.20, No.1(1983), pp. 9-13
  11. Lee, L., 'Fast context-free grammar parsing require fast Boolean matrix multiplication', JACM, Vol.49, No.1(2002), pp. 1-15 https://doi.org/10.1145/505241.505242
  12. Yi, X. et al., 'Fast Encryption for Multimedia', IEEE Transactions on Consumer Electronics, Vol.47, No.1(2001), pp.101-107 https://doi.org/10.1109/30.920426
  13. Martin, D. F., 'A Boolean matrix method for the computation of linear precedence functions', CACM, Vol.15, No.6(1972), pp. 448-454 https://doi.org/10.1145/361405.361413
  14. Nakamura, Y. and T. Yoshimura, 'A partitioning- based logic optimization method for large scale circuits with Boolean matrx', Proceedings of the 32nd ACM/IEEE conference on Design automation, (1995), pp. 653-657
  15. Pratt, V. R., 'The Power of Negative Thinking in Multiplying Boolean matrices', Proceedigs of the annual ACM symposium on Theory of computing, (1974), pp.80-83