| On the Complexity of an Algorithm for Matrix Multiplications |
| Received:August 11, 1990 |
| Key Words:
|
| Fund Project: |
|
| Hits: 2156 |
| Download times: 1933 |
| 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 |
