Register

CLRS Divide-and-Conquer Strassens's algorithm

1,301 views

2 Answers

0 0 votes

Strassen’s Algorithm is an efficient algorithm to multiply two matrices. A simple method to multiply two matrices need 3 nested loops and is O(n^3). Strassen’s algorithm multiplies two matrices in O(n^2.8974) time.

You should know some stuffs, might be useful..

Voting & Accepting an answer helps improve the community
← Previous · number of solutionsNext → · Time complexity
← Previous in category · branch and boundNext in category → · Time complexity
Position:
Show:

Related questions

1 1 vote
4 answers 4 answers
7.9k
7.9k views
LavTheRawkstar asked Apr 17, 2017
7,866 views
difference between dynamic programming and divide and conquer technique is
What is the difference between dynamic programming and divide and conquer technique,
0 0 votes
1 answers 1 answer
1.1k
1.1k views
dhruba asked May 29, 2023
1,064 views
Consider a divide and conquer algorithm that divides an input of size n into a subproblems, each of size n/b, and the cost of dividing and merging the problems is given by f(n) = Θ(n^c). The Master Theorem classifies this into different cases based on the value of c in relation to log_b(a). Could you explain the intuition and reasoning behind these classifications?
Consider a divide and conquer algorithm that divides an input of size n into a subproblems, each of size n/b, and the cost of dividing and merging the problems is given b...
0 0 votes
1 answers 1 answer
1.2k
1.2k views
ajit asked Sep 7, 2015
1,173 views
if this problem is solved using divide and conquer method ,then the algorithm run in
given a sorted array of distinct integers A[1........n], you want to find out whether there is an index i for which A[i]=i.if this problem is solved using divide and conq...
0 0 votes
0 0 answers
434
434 views
Misbah Ghaya asked Aug 17, 2022
434 views
Best Open Video Playlist for Algorithm design techniques: Divide‐and‐Conquer Topic | Algorithm
Please list out the best free available video playlist for Algorithm design techniques: Divide‐and‐Conquer from Algorithm as an answer here (only one playlist per answer)...