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

YouTube

Circuits - Graduate Complexity Lecture 4 at CMU

Ryan O'Donnell via YouTube

Overview

Google, IBM & Meta Certificates – 40% Off
One Coursera Plus subscription covers most Professional Certificates on Coursera.
Unlock All Certificates
This graduate lecture introduces circuit complexity within computational complexity theory. It examines circuit representations, size and depth, constant-depth circuits, uniform and nonuniform constructions, circuit lower bounds, and their relationships to Turing-machine computation.

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

Reviews

Start your review of Circuits - Graduate Complexity Lecture 4 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.