matrix multiplication

By -

Is there a way to multiply matrices in lesser than o(n^3) time complexity?

Comments

  1. kamakshiApril 17, 2011 at 2:27 PM

    It can be done through stassen's matrix multiplication which is O(n^2.807).

    ReplyDelete
  2. AdminApril 17, 2011 at 4:37 PM

    @kamakshi yes till now i have also come to the same conclusion..

    ReplyDelete

Post a Comment

Popular posts from this blog

By -
Given an integer n, write a function that returns count of trailing zeroes in n!. Examples: Input: n = 5 Output: 1 Factorial of 5 is 20 which has one trailing 0. Input: n = 20 Output: 4 Factorial of 20 is 2432902008176640000 which has 4 trailing zeroes. Input: n = 100 Output: 24
Read more