NP-completeness Courses
International Centre for Theoretical Sciences via YouTube Et si SAT était vraiment difficile? Quelques conséquences des hypothèses ETH - Lecture
Centre International de Rencontres Mathématiques via YouTube When and Why Do Efficient Algorithms Exist for Constraint Satisfaction and Beyond
BIMSA via YouTube Fixed-Parameter Tractability of Scheduling Dependent Tasks on m Machines Subject to Release Times and Deadlines
GERAD Research Center via YouTube