Skip to main content
Article thumbnail
Location of Repository

The border rank of the multiplication of 2 × 2 matrices is seven

By J. M. Landsberg

Abstract

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] an

Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.3914
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.math.tamu.edu/~jml/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.