[Colloquium] Complexity of matrix multiplication and tensor rank
SPEAKER | Giorgio Ottaviani
INSTITUTE | U. of Florence
DATE | February 27(Thu), 2014
TIME | 11:00
PLACE | 1503
ABSTRACT | Abstract: The naive way to multiply two matrixes is not
computationally optimal for matrices of large size.
The complexity of the algorithm of matrix multiplication coincides asymptotically with the rank of the matrix multiplication tensor.
We present some basic results in this area and a lower bound on this rank, obtained in collaboration with J.M. Landsberg,
by using techniques from algebraic geometry and representation theory.