Overview
This course on Analysis of Boolean Functions focuses on Restrictions and the Goldreich-Levin Theorem. The learning outcomes include understanding the concepts of restrictions, the Goldreich-Levin Theorem, and decision trees. The course teaches skills such as analyzing Boolean functions, working with decision trees, and understanding pseudocode. The teaching method involves lectures and discussions. This course is intended for graduate students and professionals interested in theoretical computer science and Boolean function analysis.
Syllabus
Intro
Example
Method
Discussion
Expected Square
GoldreichLevin Theorem
Properties
corollary
collection L
decision tree
pseudocode
Proof of correctness
Taught by
Ryan O'Donnell