Explore graduate-level computational complexity theory in this lecture focusing on circuits. Delve into complexity measures, classes, and constant depth circuits. Examine polyoblivious Turing machines, head movement, and uniform construction. Investigate nonuniformity, the Hierarchy Theorem, and hard to compete functions. Analyze circuit lower bounds and exponential time. This 1-hour 20-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 Chapters 6.1--6.7.
Circuits - Graduate Complexity Lecture 4 at CMU
Overview
Syllabus
Introduction
Complexity measures
Complexity classes
Constant depth circuits
Poly
oblivious Turing machines
head movement
Turing machine
Uniform construction
Nonuniformity
Hierarchy Theorem
Hard to Compete Functions
Circuit Lower Bounds
Exponential Time
Questions
Taught by
Ryan O'Donnell
Related Courses
-
The Polynomial Time Hierarchy: Graduate Complexity Lecture at CMU
-
Hierarchy Theorems - Time, Space, and Nondeterministic: Graduate Complexity Lecture at CMU
-
Razborov-Smolensky Lower Bounds for AC0[p] - Graduate Complexity Lecture at CMU
-
Approximate Counting - Graduate Complexity Lecture at CMU
-
Undergrad Complexity at CMU - Problems in P
-
More on Constant-Round Interactive Proof Systems - Graduate Complexity Lecture at CMU
