ScholarLens Back to search
2013•Advances in intelligent systems research/Advances in Intelligent Systems ResearchOpen access

Analysis of the Time Complexity of Strassen Algorithm

Xiang Wang

Open full text 0 citations

Abstract

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.

Open-access reader

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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.

Key concepts: Strassen algorithm, Matrix multiplication, Algorithm, Matrix (chemical analysis), Multiplication algorithm, Multiplication (music), Freivalds' algorithm, Computer science

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Analysis of the Time Complexity of Strassen Algorithm — Research Paper | ScholarLens