Skip to content

DAN

Seminar

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

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...

Video

Your browser can’t play this video. You do not appear to have a flash player installed.
Please download flash player or choose an alternative format instead.

Get Adobe Flash player

Available Video Formats

Back to top ∧