 Reduction (complexity)

In computational complexity theory, "reduction" is a technique used to relate the complexity of different problems. The fundamental idea is to transform one problem into another in such a way that a solution to the second problem can be used to solve the first problem. Reductions are essential for classifying problems based on their complexity and understanding the relationships between different complexity classes.