Geometry and the Complexity of Matrix Multiplication

Speaker: JM Landsberg , Texas A&M

Date: Wednesday, April 29, 2015

Time: 4:00 PM to 5:00 PM Note: all times are in the Eastern Time Zone

Public: Yes

Location: 32-G575

Event Type:

Room Description:

Host: Henry Yuen

Contact: Rebecca Yadegar, ryadegar@csail.mit.edu

Relevant URL:

Speaker URL: None

Speaker Photo:
None

Reminders to: theory-seminars@csail.mit.edu, seminars@csail.mit.edu

Reminder Subject: TALK: JM Landsberg: Geometry and the Complexity of Matrix Multiplication

Abstract: Ever since Strassen showed that nxn matrices can be multiplied
using O(n^2.81) arithmetic operations as opposed to the usual
O(n^3), there has been substantial research to determine just
how efficiently matrices can be multiplied. This has led to the astounding conjecture that asymptotically, it is nearly as easy to multiply matrices as it is to add them, more precisely, that matrices can be multiplied using O(n^{2+s}) arithmetic operations for any s>0.

I will explain how geometry has been useful in proving lower complexity bounds, and describe very recent work that indicates
how geometry may also be used to prove upper bounds. This is joint
work with L. Chiantini, C. Ikenmeyer, G. Ottaviani and M. Michalek.

Research Areas:

Impact Areas:

See other events that are part of the Algorithms and Complexity Series Fall 2014 / Spring 2015.

Created by Rebecca Yadegar Email at Monday, April 27, 2015 at 1:49 PM.