Analysis of Boolean Functions at CMU - Additive Combinatorics

Offered By: Ryan O'Donnell via YouTube

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

Automata Theory
Stanford University via edX Intro to Theoretical Computer Science
Udacity Computing: Art, Magic, Science
ETH Zurich via edX 理论计算机科学基础 | Introduction to Theoretical Computer Science
Peking University via edX Quantitative Formal Modeling and Worst-Case Performance Analysis
EIT Digital via Coursera