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
1:13:59
1:17:02
1:14:49
15-750 · A Theorist's Toolkit · Lec 16·Turing Machines & Decidability · Ryan O'Donnell · Carnegie Mellon University
25:31
Showing 8 of 8 lectures8.7h shown