skip to content
 

Arithmetic complexity and the sum of squares problem (I)

Presented by: 
A Wigderson [IAS Princeton]
Date: 
Tuesday 5th April 2011 - 14:00 to 15:00
Venue: 
INI Seminar Room 1
Abstract: 
In this lecture I will survey basic models, results and problems on the computation of computing polynomials, such as DFT, symmetric polynomials, determinant, permanent, matrix multiplication and more...
The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
University of Cambridge Research Councils UK
    Clay Mathematics Institute The Leverhulme Trust London Mathematical Society Microsoft Research NM Rothschild and Sons