Discrete Optimization Lecture 2: Decision Problems & Complexity Classes π
Explore key concepts in discrete optimization including decision problems, complexity classes, and the philosophy of duality in this comprehensive lecture from the 2025 University of Victoria course.

Jonathan Noel
116 views β’ Sep 9, 2025

About this video
This is a lecture from the course "Discrete Optimization" at the University of Victoria taught in 2025.
The topic of this lecture is Decision Problems, Complexity classes. Philosophy of Duality. We also briefly discuss the P vs NP problem. Lecture notes for this topic can be found at https://extremalcombinatorics.com/optimization/notes/sec_classesReductions.html and https://extremalcombinatorics.com/optimization/notes/sec_NPhard.html and https://extremalcombinatorics.com/optimization/notes/sec_optimizationIntro.html
The topic of this lecture is Decision Problems, Complexity classes. Philosophy of Duality. We also briefly discuss the P vs NP problem. Lecture notes for this topic can be found at https://extremalcombinatorics.com/optimization/notes/sec_classesReductions.html and https://extremalcombinatorics.com/optimization/notes/sec_NPhard.html and https://extremalcombinatorics.com/optimization/notes/sec_optimizationIntro.html
Video Information
Views
116
Likes
6
Duration
01:06:18
Published
Sep 9, 2025