Course Introduction and Overview: Graduate Complexity Lecture 1 at CMU
1:21:06
Hierarchy Theorems (Time, Space, and Nondeterministic): Graduate Complexity Lecture 2 at CMU
1:03:59
Lecture 01: Course Overview (CMU 15-462/662)
1:19:32
Undergrad Complexity at CMU - Lecture 1: Course Overview
1:19:47
Undergrad Complexity at CMU - Lecture 2: Turing Machines
1:25:25
16. Complexity: P, NP, NP-completeness, Reductions
19:44
Biggest Puzzle in Computer Science: P vs. NP
1:09:13
Lecture 1 | The Perceptron - History, Discovery, and Theory
51:12