The INI has a new website!

This is a legacy webpage. Please visit the new site to ensure you are seeing up to date information.

Skip to content



Arithmetic complexity and the sum of squares problem (I)

Wigderson, A (IAS Princeton)
Tuesday 05 April 2011, 14:00-15:00

Seminar Room 1, Newton Institute


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.

Back to top ∧