Course Overview and Formal Definition of Computation
1:19:32Turing Machines
1:19:47Simulations and Turing Machine Variants
1:20:14Time Complexity and Universal Turing Machines
1:17:57Time Hierarchy Theorem
1:20:50Problems in P
1:21:42Boolean Satisfiability (SAT)
1:20:28The Complexity Class NP
1:21:04Nondeterminism
1:21:02Reductions
1:21:41NP-Completeness and the Cook-Levin Theorem
1:16:03NP-Completeness Reductions
1:20:32Search-to-Decision, Padding, Dichotomy Theorems
1:19:56Ladner's Theorem and Mahaney's Theorem
1:22:37The Complexity Class coNP
1:21:29Space Complexity
1:21:12Savitch's Theorem and NL
1:21:12NL-Completeness and Logspace Reductions
1:20:21From P-Completeness to PSPACE-Completeness
1:19:39The Immerman-Szelepcsényi Theorem
1:21:05Ladner's Theorem and Mahaney's Theorem
This lecture presents Ladner's Theorem, demonstrating the existence of problems in NP that are neither in P nor NP-complete, and discusses Mahaney's Theorem.
Undergraduate Computational Complexity Theory Lecture 14: Ladner's Theorem and Mahaney's Theorem
Carnegie Mellon Course 15-455, Spring 2017
Search-to-Decision, Padding, Dichotomy Theorems
Next · Lecture 15The Complexity Class coNP