Author:
Morgera Salvatore D.,Krishna Hari
Reference10 articles.
1. The Design and Analysis of Computer Algorithms;Aho,1974
2. “On the Number of Multiplications Necessary to Compute Certain Functions”;Winograd;Comm. Pure and Appl. Math.,1970
3. C. M. Fiduccia, “Fast Matrix Multiplication,” in Proc. Third Ann. ACM Symp. on Theory of Computing, Shaker Heights, Ohio, pp. 45–49, May 1971.
4. “Duality Applied to the Complexity of Matrix Multiplication”;Hopcroft;SIAM Journ. Comput,1973
5. On Obtaining Upper Bounds on the Complexity of Matrix Multiplication;Fiduccia,1972