Overview: Matrix Multiplication Algorithms

October 19, 2016
2:00 pm - 5:30 pm
Hall C

Track: ACM SRC
Type: Posters
Level: All

This paper focuses on the time analysis of different matrix multiplication algorithms. The main purpose of this paper is to reduce the execution time complexities for matrix multiplication. In this paper, the methods invented by Karatsuba and Strassen algorithms. After combining these two algorithms a new approach is designed, which can be considered as a method for reducing the time complexity.


, Student, United International University