Classify problems with P, NP, NP-completeness, reductions, and intractability. You will learn when to seek exact algorithms, approximations, heuristics, or a different problem statement.
