On the Complexity of an Algorithm for Matrix Multiplications
Received:August 11, 1990  
Key Words:   
Fund Project:
Author NameAffiliation
Zhang Zhenxiang Anhui Normal University
Wuhu
China
State Key Labotory of Information Security Graduate School of Uni. of Sci. & Tech. of China
Beijing
China 
Hits: 2288
Download times: 1992
Abstract:
      The complexity of the conventional algorithm for multiplying two n * n matrices of non-negative integers is O(n3). Jiang and Wu [1] give an "optimal" algorithm with O(n2) "operations ". In this paper we conclude that the complexity of this algorithm is not lower than O(n3log2n), so it is worse than the conventional algorithm.
Citation:
DOI:10.3770/j.issn:1000-341X.1992.03.027
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.