Skip to content

DAN

Seminar

The power and weakness of randomness, when you are short on time (Rothschild Lecture)

Wigderson, A (IAS, Princeton)
Monday 28 March 2011, 17:00-18:00

Seminar Room 1, Newton Institute

Abstract

Man has grappled with the meaning and utility of randomness for centuries. Research in the Theory of Computation in the last thirty years has enriched this study considerably. I'll describe two main aspects of this research on randomness, demonstrating respectively its power and weakness for making algorithms efficient. Time permitting, I will address the role of randomness in other computational settings, such as space bounded computation and probabilistic and zero-knowledge proofs.

Presentation

[pdf ] [ppt ]

Video

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 ∧