Google For Power Series use matrix exponentiation
Complexity O(n^3 (logn)^2) On Fri, Apr 1, 2011 at 9:25 PM, Rahul Singal <[email protected]> wrote: > Hi geeks, > Please help me in solving this problem > you have to sum m+ m^2 + m^3 ..... + m^n where m is a square matrix > > how to efficiently do this better than O(n) time ?? > > Thanks > Rahul > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
