The following will be discussed in this chapter: NP-Hard and NP-Complete problems, 3SAT, Super Mario Brothers, 3 Dimensional Matching (3DM), Subset Sum, Partition, Rectangle Packing, Jigsaw Puzzles. | Lecture Design and Analysis of Algorithms - Lecture 16 NP-Completeness