Comments on: Computer Algorithms: Strassen’s Matrix Multiplication /2012/11/26/computer-algorithms-strassens-matrix-multiplication/ on web development Fri, 26 Oct 2018 21:40:18 +0000 hourly 1 https://wordpress.org/?v=5.0.3 By: akash /2012/11/26/computer-algorithms-strassens-matrix-multiplication/comment-page-1/#comment-440326 Tue, 31 Jan 2017 07:02:19 +0000 /?p=3466#comment-440326 how can we get n*n matrix multiplication using Strassen’s multiplication using recursion and structure????

]]> By: Sangram /2012/11/26/computer-algorithms-strassens-matrix-multiplication/comment-page-1/#comment-428246 Sat, 05 Nov 2016 23:37:34 +0000 /?p=3466#comment-428246 Please give the explanation of P1…P7 and how this algorithm can be used for n>2?

]]> By: shubhangi ramteke /2012/11/26/computer-algorithms-strassens-matrix-multiplication/comment-page-1/#comment-407605 Sun, 15 May 2016 19:55:42 +0000 /?p=3466#comment-407605 thankuuu…u really help mi in AOA.

]]> By: Shruti /2012/11/26/computer-algorithms-strassens-matrix-multiplication/comment-page-1/#comment-403111 Sat, 02 Apr 2016 11:15:27 +0000 /?p=3466#comment-403111 thank you so much..really helpful

]]> By: GM /2012/11/26/computer-algorithms-strassens-matrix-multiplication/comment-page-1/#comment-399969 Fri, 11 Mar 2016 04:14:40 +0000 /?p=3466#comment-399969 how you got this equation
p1,p2,p3,p4,p5,p6,p7

]]> By: Salem (jeje) Wiseman /2012/11/26/computer-algorithms-strassens-matrix-multiplication/comment-page-1/#comment-397146 Wed, 10 Feb 2016 17:05:34 +0000 /?p=3466#comment-397146 binary search is a searching algorithm.in each step.the agorithm compares the input element x with the value of the middle element in array.if the value match,return the index of middle.otherwise.if x is less than the middle element.then the algorithm recurs for left side middle element.else recurs for right side middle element.

]]> By: Salem (jeje) Wiseman /2012/11/26/computer-algorithms-strassens-matrix-multiplication/comment-page-1/#comment-397144 Wed, 10 Feb 2016 16:56:13 +0000 /?p=3466#comment-397144 strassen algorithm is an efficient algorithm to multiply two matrices.A simple method to multiply two matrices need 3 nested loops and is 0(n^3).Strassens algorithm multiplies two matrices in 0(n^2.8974) time.

]]> By: Fernando Pauer /2012/11/26/computer-algorithms-strassens-matrix-multiplication/comment-page-1/#comment-392826 Fri, 08 Jan 2016 19:43:47 +0000 /?p=3466#comment-392826 Reference: https://en.wikipedia.org/wiki/Strassen_algorithm

]]> By: Fernando Pauer /2012/11/26/computer-algorithms-strassens-matrix-multiplication/comment-page-1/#comment-392822 Fri, 08 Jan 2016 19:31:34 +0000 /?p=3466#comment-392822 Hi,

Your Strassem Algorithm is wrong!

Wrong: p1 + p5 – p3 – p7

Correct: p1 + p5 – p3 + p7

]]> By: Abhilasha /2012/11/26/computer-algorithms-strassens-matrix-multiplication/comment-page-1/#comment-389180 Tue, 15 Dec 2015 06:21:23 +0000 /?p=3466#comment-389180 nice information helpful for me !!!

]]>