Takaoka's algorithm reduces the all pairs shortest path problem to this performing this operation. This
 operation on a certain set defines the GL group. One algorithm used to perform this operation is the
 Coppersmith-Winograd algorithm which is faster than the Strassen algorithm. Computing the evolution of a
 finitely described Markov process is done by repeated application of this operation. This operation permits
 zero divisors. This operation is used to perform finite dimension linear maps. This operation is distributive
 and associative, but not commutative. For 10 points, name this oper
Takaoka's algorithm reduces the all pairs shortest path problem to this performing this operation. This
 operation on a certain set defines the GL group. One algorithm used to perform this operation is the
 Coppersmith-Winograd algorithm which is faster than the Strassen algorithm. Computing the evolution of a
 finitely described Markov process is done by repeated application of this operation. This operation permits
 zero divisors. This operation is used to perform finite dimension linear maps. This operation is distributive
 and associative, but not commutative. For 10 points, name this operation which involves taking the product
 of two matrices.
Takaoka's algorithm reduces the all pairs shortest path problem to this performing this operation.
matrix {multiplication}