3 votes 3 votes Algorithms algorithms matrix-chain-ordering test-series + – Sourabh Kumar asked May 21, 2016 • retagged Jul 16, 2022 by makhdoom ghaya Sourabh Kumar 1.9k views answer comment Share Follow See 1 comment See all 1 1 comment reply Lakshman Bhaiya commented Nov 11, 2018 reply Follow Share can anyone provide me a source for reference to read it? 0 votes 0 votes Please log in or register to add a comment.
Best answer 9 votes 9 votes If the order of Matrix is N then Strassen's Matrix Multiplication takes time. In the given Problem, N is 4, then (4^2.8074) = 49.0030, which is approx 50. Hence Answer C) 50 will be correct. rude answered May 21, 2016 • selected May 24, 2016 by srestha rude comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Sourabh Kumar commented May 21, 2016 reply Follow Share thanx rude. 0 votes 0 votes rude commented May 22, 2016 reply Follow Share @sourabh Mark best answer. please 0 votes 0 votes rude commented May 24, 2016 reply Follow Share Welcome back sir, Gateoverflow is not same without you :D @Arjun sir, please verify this. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Two matrices of order 4⨉4 Total number of multiplication using Strassen Multiplication method 4⨉4⨉4=64 srestha answered May 21, 2016 srestha comment Share Follow See all 4 Comments See all 4 4 Comments reply ManojK commented May 21, 2016 reply Follow Share Strassen Multiplication =n2.81 0 votes 0 votes set2018 commented Oct 6, 2017 reply Follow Share srestha why this is not correct 4⨉4⨉4=64 0 votes 0 votes saxena0612 commented Oct 6, 2017 reply Follow Share @ set2018 Using strassen matrix multiplication mentioned in problem. 0 votes 0 votes srestha commented Oct 7, 2017 reply Follow Share @ set2018 chk selected ans 0 votes 0 votes Please log in or register to add a comment.
