[Colloquium] Christian Ikenmeyer's Talk

[Donna Brooms]

PLEASE DON'T MISS CHRISTIAN IKENMEYER'S TALK IN RY. 251. IT STARTS IN 15 MINUTES.

On May 21, 2015, at 9:36 AM, Donna Brooms <donna at cs.uchicago.edu> wrote:

> *REMINDER*
> 
> Computer Science Seminar
>  
> Christian Ikenmeyer
> Texas A&M Univeristy
> 
> Thursday 21, 2015
> Ryerson 251@ 3 pm
>  
> Title: “Geometric Complexity Theory and Tensor Rank of Matrix Multiplication”
>  
> Abstract: The famous P vs NP problem is a conjecture about the inherent difficulties of certain computational problems. Based on work of Valiant from 1979, Mulmuley and Sohoni in 2001 proposed to view algebraic variants of the P vs NP problem as specific orbit closure problems and to attack them by methods from geometric invariant and representation theory. They coined the term geometric complexity theory for their approach. It turns out that key ideas can also be used to study the complexity of computational tasks in linear algebra, most notably matrix multiplication. This insight is based on a line of research on bilinear maps and tensor rank started by Strassen in 1969.
>  
> Host by Prof. Ketan Mulmuley
>  
>  (Refreshments will be served prior to the talk in Ry. 255 @ 2:30pm)
>  
>  
>  

-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://mailman.cs.uchicago.edu/pipermail/colloquium/attachments/20150521/1fd9aaa1/attachment.htm