Skip to content
lectern.tv
CMU 15-455: Undergraduate Complexity Theory →0/20
1

Lecture 1: Course Overview and Formal Definition of Computation (15-455)

1:19:32
2

Lecture 2: Turing Machines (15-455)

1:19:47
3

Lecture 3: Simulations and Turing Machine Variants (15-455)

1:20:14
4

Lecture 4: Time Complexity and Universal Turing Machines (15-455)

1:17:57
5

Lecture 5: Time Hierarchy Theorem (15-455)

1:20:50
6

Lecture 6: Problems in P (15-455)

1:21:42
7

Lecture 7: SAT (15-455)

1:20:28
8

Lecture 8: NP (15-455)

1:21:04
9

Lecture 9: Nondeterminism (15-455)

1:21:02
10

Lecture 10: Reductions (15-455)

1:21:41
11

Lecture 11: NP-Completeness and the Cook-Levin Theorem (15-455)

1:16:03
12

Lecture 12: NP-Completeness Reductions (15-455)

1:20:32
13

Lecture 13: Search-to-Decision, Padding, Dichotomy Theorems (15-455)

1:19:56
14

Lecture 14: Ladner's Theorem and Mahaney's Theorem (15-455)

1:22:37
15

Lecture 15: coNP (15-455)

1:21:29
16

Lecture 16: Space Complexity (15-455)

1:21:12
17

Lecture 17: Savitch's Theorem and NL (15-455)

1:21:12
18

Lecture 18: NL-Completeness and Logspace Reductions (15-455)

1:20:21
19

Lecture 19: From P-Completeness to PSPACE-Completeness (15-455)

1:19:39
20

Lecture 20: The Immerman-Szelepcsényi Theorem (15-455)

1:21:05

Lecture 12: NP-Completeness Reductions (15-455)

David WitmerCarnegie Mellon University

Professor

1:20:32·2017·undergraduate level

Guest lecturer David Witmer demonstrates various NP-completeness reductions, showcasing how to prove the hardness of new problems by relating them to known NP-complete problems.

Theory & AlgosComputational ComplexityAlgorithms & Data StructuresNP-CompletenessReductions

Undergraduate Computational Complexity Theory

Lecture 12: NP-Completeness Reductions

Carnegie Mellon Course 15-455, Spring 2017

Previous · Lecture 11

Lecture 11: NP-Completeness and the Cook-Levin Theorem (15-455)

Next · Lecture 13

Lecture 13: Search-to-Decision, Padding, Dichotomy Theorems (15-455)

Comments

Add a comment...Sign in