AI, Data Science & Cloud Certificates from Google, IBM & Meta
You’re only 3 weeks away from a new language
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