Graduate Computational Complexity Theory · Lec 4·P vs NP & NP-Completeness · Ryan O'Donnell · Carnegie Mellon University
1:19:50
Academic Discipline
Algorithms & Theory
Algorithms, data structures, computational complexity, cryptography, formal verification, logic, and type theory.
14courses72standalone talks340total lectures
Subfields
Computational Complexity— Complexity classes, P vs NP, reductions, Turing machines, circuit complexity, and PCP theorems.
12 topicsjknavigate↵watchcchaptersssavexwatched
Save
15-750 · A Theorist's Toolkit · Lec 17·Turing Machines & Decidability · Ryan O'Donnell · Carnegie Mellon University
29:07