Analysis of the Time Complexity of Strassen Algorithm
Available Online September 2013.
- 10.2991/icsecs-13.2013.21How to use a DOI?
- algorithms for matrix multiplication; time complexity; Strassen algorithm
Algorithms of matrix multiplication are widely used in software engineering field. Application of Strassen algorithm makes a significant contribution to optimize the algorithm . Therefore, thorough study based on time complexity of matrix multiplication algorithm is very important. This paper talks about the time complexity of Strassen algorithm and general algorithm for matrix multiplication, and makes a comparison between the two algorithm routines so as to discuss the advantages and disadvantages of Strassen algorithm. The rational utilization plan of matrix multiplication algorithms is also discussed.
- © 2013, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Xiang Wang PY - 2013/09 DA - 2013/09 TI - Analysis of the Time Complexity of Strassen Algorithm BT - Proceedings of the 2013 International Conference on Software Engineering and Computer Science PB - Atlantis Press SP - 103 EP - 106 SN - 1951-6851 UR - https://doi.org/10.2991/icsecs-13.2013.21 DO - 10.2991/icsecs-13.2013.21 ID - Wang2013/09 ER -