how many float point operations for a strassen algorithm for a matrix of size k*k

Question

I am trying to understand this http://en.wikipedia.org/wiki/Strassen%5Falgorithm#Numerical%5Fanalysis

But i am still not too sure how many operations are invovled?

Answer 1

Given the page says it is approximately O(N^2.807...) I would guess that would be a good approximation of the number of floating-point operations. All the looping/iterating will be with integer operations.