The fastest known algorithm for this operation, published in 2011 by Vassilevska Williams, takes time proportional to the order of the inputs raised to the power of two point three seven two seven, and is an extension of a divide-and-conquer method by Strassen, where the trick is to take one fewer scalar product at the cost of extra scalar sums in the base case of order two.
The fastest known algorithm for this operation, published in 2011 by Vassilevska Williams, takes time proportional to the order of the inputs raised to the power of two point three seven two seven, and is an extension of a divide-and-conquer method by Strassen, where the trick is to take one fewer scalar product at the cost of extra scalar sums in the base case of order two. For 10 points, what is this operation that, relative to a common basis, gives the coefficients of the composition of two linear transformations?
The fastest known algorithm for this operation, published in 2011 by Vassilevska Williams, takes time proportional to the order of the inputs raised to the power of two point three seven two seven, and is an extension of a divide-and-conquer method by Strassen, where the trick is to take one fewer scalar product at the cost of extra scalar sums in the base case of order two.
matrix multiplication ( or  matrix multiply)