Razborov-Smolensky Lower Bounds for AC0[p] - Graduate Complexity Lecture at CMU
Offered By: Ryan O'Donnell via YouTube
Course Description
Overview
Explore the Razborov--Smolensky lower bounds for AC0[p] in this graduate-level computational complexity theory lecture. Delve into explicit language, key definitions, and theorems, including Fermat's theorem. Learn about gate-by-gate replacement techniques, focusing on Mod3 and Or gates. Examine error bounds and the concept of fixing an X. Engage with exercises on twowise universal hashing and P twiddle. This 73-minute lecture, part of Carnegie Mellon's Course 15-855 (Fall 2017), is taught by Ryan O'Donnell and includes suggested reading from Arora--Barak Chapter 14.2.
Syllabus
Introduction
Explicit language
Definitions
Theorems
Fermats theorem
Gate by gate replacement
Mod3 gates
Or gates
Error bound
Fix an X
Exercise
Twowise Universal Hashing
P twiddle
Taught by
Ryan O'Donnell
Related Courses
算法设计与分析(高级) | Advanced Design and Analysis of AlgorithmsPeking University via edX 理论计算机科学基础 | Introduction to Theoretical Computer Science
Peking University via edX An Introduction to Algorithmics
Pluralsight The Introduction to Quantum Computing
Saint Petersburg State University via Coursera Computational Complexity
IIT Hyderabad via Swayam