Many-one reduction (problem)
programming
Many-one reduction
There is a many-one reduction of problem $A$ to $B$ ($A \rightarrow B$ or $A \leq B$) if a polynomial time algorithm to solve $B$ would also solve $A$ in polynomial time.
There is a many-one reduction of problem $A$ to $B$ ($A \rightarrow B$ or $A \leq B$) if a polynomial time algorithm to solve $B$ would also solve $A$ in polynomial time.