YoVDO

Analysis of Boolean Functions at CMU - Additive Combinatorics

Offered By: Ryan O'Donnell via YouTube

Tags

Theoretical Computer Science Courses Subspaces Courses Additive Combinatorics Courses

Course Description

Overview

Explore additive combinatorics in this graduate-level lecture from Carnegie Mellon University's course on Analysis of Boolean Functions. Delve into key concepts such as subspace notation, cosets, Hamming balls, and the Fryman region conjecture. Learn about important theorems and their applications in boolean function analysis. Gain insights from Professor Ryan O'Donnell's expertise in this comprehensive 82-minute session, part of the Fall 2012 course series.

Syllabus

Intro
Notation
Subspace notation
Cosets
Subspaces
Hamming ball
Fryman region conjecture
Theorem


Taught by

Ryan O'Donnell

Related Courses

Graph Theory and Additive Combinatorics
Massachusetts Institute of Technology via MIT OpenCourseWare
Associativity Testing - Ben Green
Institute for Advanced Study via YouTube
The Selberg Sieve and Large Sieve - Lecture 1
International Centre for Theoretical Sciences via YouTube
The Selberg Sieve - Lecture 1
International Centre for Theoretical Sciences via YouTube
Basic Lower Bounds and Kneser's Theorem by David Grynkiewicz
International Centre for Theoretical Sciences via YouTube