09: Subset Sum-/Partition-/Knapsack-Problem, NPI-/co-P-/co-NP - Klassen, Graphisomorphie Problem

Round-16 hunt: picked; source: deeper uploads from a strong channel accepted this round; channel already live on Lumen; strict per-title check + final strict pass; title rules; oEmbed verified.

A 84-minute video from KIT Lehre und Wissen: “09: Subset Sum-/Partition-/Knapsack-Problem, NPI-/co-P-/co-NP - Klassen, Graphisomorphie Problem”.

Video by KIT Lehre und Wissen, played through YouTube's embedded player.