Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Razborov-Smolensky Lower Bounds for AC0[p] - Graduate Complexity Lecture at CMU

Ryan O'Donnell via YouTube

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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

Reviews

Start your review of Razborov-Smolensky Lower Bounds for AC0[p] - Graduate Complexity Lecture at CMU

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.