Introduces problem reductions and their implications for algorithm speed and hardness, with examples including bipartite matching to max flow, polynomial-time problems to linear programming, and matrix inversion to matrix multiplication.
Save to open this file