reduction
transformation of one computational problem to another, used to show that the second problem is as difficult as the first
Turing reduction
concept in computability theory
polynomial-time reduction
method for solving one problem using another
first-order reduction
in computer science, a very strong type of reduction between two computational problems in computational complexity theory