1 |
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
DOI
|
2 |
Froidure, V. and J. E. Pin, "Algorithms for computing finite semigroups", Cucker (ed.), Foundations of Computational Mathemtics, Berlin, Springer, 1997, pp.112-126
|
3 |
한재일, "모든 n 차 정사각 불리언 행렬 사이의 효율적 이중 연속곱셈에 관한 연구", Journal of The Korean Data Analysis Society, Vol.3, No.3(2006), pp.526-531
|
4 |
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
|
5 |
Kim, K. H. and F. W. Roush, "On generating regular elements in the semigroup of binary relations", Semigroup Forum No.14 (1997), pp.29-32
|
6 |
한재일, "모든 불리언 행렬 사이의 중첩곱셈에 대한 연구", 한국IT서비스학회지, 제5권, 제1호(2006), pp.1209-1220
과학기술학회마을
|
7 |
Booth, K. S., "Boolean matrix multiplication using only bit operations", ACM SIGACT News, Vol.9, No.3 (1977), pp.23
DOI
|