 In a general sense, a problem (or set) is said to be reducible to another problem (or set), if there is a computable/feasible method to translate the questions of the former into the latter, so that, if one knows how to computably/feasibly solve the latter problem, then one can computably/feasibly solve the former.Thus, the latter can only be at least as "hard" to solve as the former.Reduction in theoretical computer science is pervasive in both