Speaker Gil Kalai
Affiliation Hebrew University
Host Yuval Peres
Date recorded 25 November 2013
Analysis of Boolean functions is a meeting point of combinatorics, probability theory, harmonic analysis, and the theory of computing. The lecture will describe some advances and challenges in this area. We will discuss discrete isoperimetric inequalities, influences, threshold phenomena for stochastic models, and noise-sensitivity as well as some connections with social choice theory.
©2013 Microsoft Corporation. All rights reserved.
By the same speaker
Is there an (interesting?/realistic?/universal?) model for noise which reduces quantum computation to classical computation?
People also watched