School of Mathematics
In math, one often studies random aspects of deterministic systems and structures. In CS, one often tries to efficiently create structures and systems with specific random-like properties. Recent work has shown many connections between these two approaches through the concept of "pseudorandomness".
Lectures by Bourgain, Impagliazzo, Sarnak and Wigderson (schedule below), will explore some of the facets of pseudorandomness, with particular emphasis on research directions and open problems that connect the different viewpoints of this concept in math and CS.
In these lectures we will describe the relationship between optimal transportation and nonlinear elliptic PDE of Monge-Ampere type, focusing on recent advances in characterizing costs and domains for which the Monge-Kantorovich problem has smooth diffeomorphism solutions.
L.C Evans, PDE and Monge-Kantorovich mass transfer. Current developments in Mathematics, 1997. Int. Press, Boston, (1999).
The "P vs. NP" problem is a central outstanding problem of computer science and mathematics. In this talk, Professor Wigderson attempts to describe its technical, scientific, and philosophical content, its status, and the implications of its two possible resolutions.