Reduction
In computability theory and computational complexity theory, the so-called reduction is the process of converting a computational problem to another. The reduction class can be defined by the reduction method (depending on the conversion process). In an intuitive view, "Problem A can be reduced to question B", and the answer to question B can be used to solve question A. So resolving A will not be difficult to solve. We write A ≤ B, usually also used in the ≤ symbol subscript reduction approach. ...