Geometry and the complexity of matrix multiplication
Computational Complexity
2007-05-23 v1 Algebraic Geometry
Representation Theory
Abstract
We survey results in algebraic complexity theory, focusing on matrix multiplication. Our goals are (i.) to show how open questions in algebraic complexity theory are naturally posed as questions in geometry and representation theory, (ii.) to motivate researchers to work on these questions, and (iii.) to point out relations with more general problems in geometry. The key geometric objects for our study are the secant varieties of Segre varieties. We explain how these varieties are also useful for algebraic statistics, the study of phylogenetic invariants, and quantum computing.
Cite
@article{arxiv.cs/0703059,
title = {Geometry and the complexity of matrix multiplication},
author = {J. M. Landsberg},
journal= {arXiv preprint arXiv:cs/0703059},
year = {2007}
}
Comments
34 pages, 4 figures