Analysis of Boolean Functions

Posted on November 28, 2010 by

I discovered a vidiotaped lecture I gave at the Open University on the 3rd Israeli Theory Day. Enjoy!



Posts related to this lecture: Noise Stability and threshold circuits; Noise stability lecture and tales;  Nati’s influence.

About these ads
This entry was posted in Computer Science and Optimization. Bookmark the permalink.

3 Responses to Analysis of Boolean Functions

  1. Pingback: Tweets that mention Analysis of Boolean Functions | Combinatorics and more -- Topsy.com

  2. Pingback: To Life, to Science and to Innovations | Combinatorics and more

  3. Pingback: Noise Sensitivity and Percolation. Lecture Notes by Christophe Garban and Jeff Steif | Combinatorics and more

Leave a Reply

Fill in your details below or click an icon to log in:

Gravatar
WordPress.com Logo

You are commenting using your WordPress.com account. ( Log Out / Change )

Twitter picture

You are commenting using your Twitter account. ( Log Out / Change )

Facebook photo

You are commenting using your Facebook account. ( Log Out / Change )

Cancel

Connecting to %s