PARTIAL AND TOTAL MATRIX MULTIPLICATION

[1] O(N2.7799) COMPLEXITY FOR N BY N APPROXIMATE MATRIX MULTIPLICATION [J]. INFORMATION PROCESSING LETTERS, 1979, 8 (05) : 234 - 235

[2] BINI D, 1979, B798 IEI NOT INT

[3] de Groote H. F., 1978, Theoretical Computer Science, V7, P127, DOI 10.1016/0304-3975(78)90045-2

[4] Hopcroft J., 1973, SIAM Journal on Computing, V2, P159, DOI 10.1137/0202013

[5] MINIMIZING NUMBER OF MULTIPLICATIONS NECESSARY FOR MATRIX MULTIPLICATION [J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1971, 20 (01) : 30 - &

[6] NONCOMMUTATIVE ALGORITHM FOR MULTIPLYING 3 X 3 MATRICES USING 23 MULTIPLICATIONS [J]. BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1976, 82 (01) : 126 - 128

[7] Pan V. Ya., 1978, 19th Annual Symposium on Foundations of Computer Science, P166, DOI 10.1109/SFCS.1978.34

[8] NEW FAST ALGORITHMS FOR MATRIX OPERATIONS [J]. SIAM JOURNAL ON COMPUTING, 1980, 9 (02) : 321 - 342

[9] PAN VY, 1979, IBM RC7555 TJ WATS R

[10] PAN VY, 1979, 20TH P IEEE S F COMP

[1] O(N2.7799) COMPLEXITY FOR N BY N APPROXIMATE MATRIX MULTIPLICATION [J]. INFORMATION PROCESSING LETTERS, 1979, 8 (05) : 234 - 235

[2] BINI D, 1979, B798 IEI NOT INT

[3] de Groote H. F., 1978, Theoretical Computer Science, V7, P127, DOI 10.1016/0304-3975(78)90045-2

[4] Hopcroft J., 1973, SIAM Journal on Computing, V2, P159, DOI 10.1137/0202013

[5] MINIMIZING NUMBER OF MULTIPLICATIONS NECESSARY FOR MATRIX MULTIPLICATION [J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1971, 20 (01) : 30 - &

[6] NONCOMMUTATIVE ALGORITHM FOR MULTIPLYING 3 X 3 MATRICES USING 23 MULTIPLICATIONS [J]. BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1976, 82 (01) : 126 - 128

[7] Pan V. Ya., 1978, 19th Annual Symposium on Foundations of Computer Science, P166, DOI 10.1109/SFCS.1978.34

[8] NEW FAST ALGORITHMS FOR MATRIX OPERATIONS [J]. SIAM JOURNAL ON COMPUTING, 1980, 9 (02) : 321 - 342

[9] PAN VY, 1979, IBM RC7555 TJ WATS R

[10] PAN VY, 1979, 20TH P IEEE S F COMP