Lecture 1: Course Overview and Formal Definition of Computation (15-455)
1:19:32Lecture 2: Turing Machines (15-455)
1:19:47Lecture 3: Simulations and Turing Machine Variants (15-455)
1:20:14Lecture 4: Time Complexity and Universal Turing Machines (15-455)
1:17:57Lecture 5: Time Hierarchy Theorem (15-455)
1:20:50Lecture 6: Problems in P (15-455)
1:21:42Lecture 7: SAT (15-455)
1:20:28Lecture 8: NP (15-455)
1:21:04Lecture 9: Nondeterminism (15-455)
1:21:02Lecture 10: Reductions (15-455)
1:21:41Lecture 11: NP-Completeness and the Cook-Levin Theorem (15-455)
1:16:03Lecture 12: NP-Completeness Reductions (15-455)
1:20:32Lecture 13: Search-to-Decision, Padding, Dichotomy Theorems (15-455)
1:19:56Lecture 14: Ladner's Theorem and Mahaney's Theorem (15-455)
1:22:37Lecture 15: coNP (15-455)
1:21:29Lecture 16: Space Complexity (15-455)
1:21:12Lecture 17: Savitch's Theorem and NL (15-455)
1:21:12Lecture 18: NL-Completeness and Logspace Reductions (15-455)
1:20:21Lecture 19: From P-Completeness to PSPACE-Completeness (15-455)
1:19:39Lecture 20: The Immerman-Szelepcsényi Theorem (15-455)
1:21:05Lecture 6: Problems in P (15-455)
This lecture delves into the class P, discussing problems solvable in polynomial time and examining specific examples like PATH and RELPRIME to illustrate its scope.
Undergraduate Computational Complexity Theory
Lecture 6: Simulations and Turing Machine Variants
Carnegie Mellon Course 15-455, Spring 2017
Lecture 5: Time Hierarchy Theorem (15-455)
Next · Lecture 7Lecture 7: SAT (15-455)