Skip to content Skip to navigation
Computer Science Department Colloquium
11/24/2015 12:00 pm
Core Lecture Hall (Room 101)

Geometry and the complexity of matrix multiplication

J M Landsberg, Texas A&M University

Faculty Host: Eric Allender


It has been known for some time that algebraic geometry and representation theory are useful for proving lower bounds on the complexity of the matrix multiplication operator. In this talk I will explain how geometry can be used to prove both upper and lower bounds. After a discussion of the problem and its history, I will present very recent work with M. Michalek on border rank algorithms.