Understanding Computational Complexity: Karp-Lipton, Meyer's Theorem & Circuit Classes 📚
Explore key concepts in computational complexity including the Size Hierarchy Theorem, Turing Machines with advice, and important circuit classes like NC and AC in Lecture 12 with instructor Rampras.
STCS TIFR
333 views • Apr 22, 2021
About this video
Agenda: Karp-Lipton and Meyer's theorem; Size hierarchy theorem; Turing Machines with advice; some important circuit classes (NC and AC)
Instructor: Ramprasad Saptharishi
Instructor: Ramprasad Saptharishi
Video Information
Views
333
Likes
3
Duration
01:38:46
Published
Apr 22, 2021