MINIMIZING NUMBER OF MULTIPLICATIONS NECESSARY FOR MATRIX MULTIPLICATION

[1] HOPCROFT JE, 1969, TR6944 CORN U DEP CO

[2] KLYUYEV VV, 1965, TRCS24 STANF U DEP C

[3] PAN VY, 1921, RUSSIAN MATH SURVEYS, V21, P105

[4] GAUSSIAN ELIMINATION IS NOT OPTIMAL [J]. NUMERISCHE MATHEMATIK, 1969, 13 (04) : 354 - &

[5] A NEW ALGORITHM FOR INNER PRODUCT [J]. IEEE TRANSACTIONS ON COMPUTERS, 1968, C 17 (07) : 693 - &

[6] ON NUMBER OF MULTIPLICATIONS REQUIRED TO COMPUTE CERTAIN FUNCTIONS [J]. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 1967, 58 (05) : 1840 - &

[1] HOPCROFT JE, 1969, TR6944 CORN U DEP CO

[2] KLYUYEV VV, 1965, TRCS24 STANF U DEP C

[3] PAN VY, 1921, RUSSIAN MATH SURVEYS, V21, P105

[4] GAUSSIAN ELIMINATION IS NOT OPTIMAL [J]. NUMERISCHE MATHEMATIK, 1969, 13 (04) : 354 - &

[5] A NEW ALGORITHM FOR INNER PRODUCT [J]. IEEE TRANSACTIONS ON COMPUTERS, 1968, C 17 (07) : 693 - &

[6] ON NUMBER OF MULTIPLICATIONS REQUIRED TO COMPUTE CERTAIN FUNCTIONS [J]. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 1967, 58 (05) : 1840 - &