In computational complexity theory, a polynomial-time reduction is a method for solving one problem using another. Wikipedia