What is the essence of polynomial transformations?

Question

Programming

Perhaps the last 2 tags are superfluous, I just didn’t quite orient myself. Problems of P and NP classes are related to the theory of algorithms. But when trying to find something about polynomial transformations, I only see related to geography.
The bottom line: I'm preparing to enter the master's program (passing the exam) in the direction of "Mathematics and Computer Science". This is due to the fact that geography does not fit well here. Thanks in advance for your replies.

Answer 1

polynomial transformations
This is similar to translating from Russian into English and vice versa.
Polynomial reducibility, less often transformability, Karp reducibility, sometimes just reducibility.
In English, polynomial-time reduction, very rarely transformation.
Briefly, the point is that two problems are polynomially reducible if there is a polynomial transformation from one to the other. In the class P (NP) there are problems to which all other problems from the class are reduced.