Results 1 
3 of
3
Geometry and the complexity of matrix multiplication
, 2007
"... 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, ..."
Abstract

Cited by 22 (3 self)
 Add to MetaCart
(Show Context)
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.
The border rank of the multiplication of 2 × 2 matrices is seven
 J. Amer. Math. Soc
"... One of the leading problems of algebraic complexity theory is matrix multiplication. The naïve multiplication of two n × n matrices uses n 3 multiplications. In 1969, Strassen [20] presented an explicit algorithm for multiplying 2 × 2 matrices using seven multiplications. In the opposite direction, ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
(Show Context)
One of the leading problems of algebraic complexity theory is matrix multiplication. The naïve multiplication of two n × n matrices uses n 3 multiplications. In 1969, Strassen [20] presented an explicit algorithm for multiplying 2 × 2 matrices using seven multiplications. In the opposite direction, Hopcroft and Kerr [12] and
GEOMETRY AND COMPLEXITY THEORY
"... In this lecture I introduce two problems in complexity: determining the complexity of matrix multiplication, and the separation of algbraic complexity classes, especially VPs and VNP. Included at the end are notational conventions useful formulas. 1.1. Matrix multiplication. The workhorse of scienti ..."
Abstract
 Add to MetaCart
(Show Context)
In this lecture I introduce two problems in complexity: determining the complexity of matrix multiplication, and the separation of algbraic complexity classes, especially VPs and VNP. Included at the end are notational conventions useful formulas. 1.1. Matrix multiplication. The workhorse of scientific computation is matrix multiplication.