Videos

Pseudorandomness in Mathematics and Computer Science Mini-Workshop

Presenter
December 3, 2008
Keywords:
  • Computer Science and Discrete Mathematics (CSDM)
Abstract
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.The lectures will be aimed at nonspecialists, and hope to attract researchers to this exciting area. There will be a time for discussion after each lecture.