On the Complexity of an Improved Algorithm for Matrix Multiplications
Received:September 16, 1996  
Key Words: matrix multiplications   algorithm analysis   bit operations   time compiexity   computational number theory.  
Fund Project:
Author NameAffiliation
ZHANG Zhen-xiang Dept. of Math.
Anhui Normal University
Wuhu
State Key Labotory of information Security
graduate School of Uni. of Set. & Tech. of China
Beijing 100039 
Hits: 3096
Download times: 1965
Abstract:
      The complexity of the conventional algorithm for multiplying two nn matrices ofnon--negative integers is O (n３). Jiang and Wu [1] gave an "optimal" algorithm with O (n2)"operations". Later they [2] gave three ways to improve the algorithm. In this paper weconclude that the complexity of the improved algorithm is not yet lower than O (n３logn), soits order is still higher than that of the conventional algorithm.
Citation:
DOI:10.3770/j.issn:1000-341X.1999.04.016
View Full Text  View/Add Comment  
  Copyright © Journal of Mathematical Research with Applications
Sponsored by：Dalian University of Technology, China Society for Industrial and Applied Mathematics
Address：No.2 Linggong Road, Ganjingzi District, Dalian City, Liaoning Province, P. R. China , Postal code ：116024
Service Tel：86-411-84707392 Email：jmre@dlut.edu.cn
Designed by Beijing E-tiller Co.,Ltd.
Due to security factors, early browsers cannot log in. It is recommended to log in with IE10, IE11, Google, Firefox, and 360 new browsers.