The most commonly used reduction is a polynomial-time reduction. This means that the reduction process takes polynomial time. For example, the problem of squaring an integer can be reduced to the problem of multiplying two integers. This means an algorithm for multiplying two integers can be used to square an integer. Indeed, this can be done by giving the same input to both inputs of the multiplication algorithm. Thus we see that squaring is not more difficult than multiplication, since squaring can be reduced to multiplication.
What is the most frequently employed type of reduction? What equates to a squared integer according to polynomial time reduction? What measurement of time is used in polynomial time reduction? What would need to remain constant in a multiplication algorithm to produce the same outcome whether multiplying or squaring two integers?   According to polynomial time reduction squaring can ultimately be logically reduced to what?