[UVA][SCC] 1243 - Polynomial-time Reductions
In computational complexity theory, polynomial-time reduction is an important concept.
If the existence of a polynomial-time algorithm for problem B
implies that problem A
also has a polynomial-time algorithm, we say that problem A
has a polynomial-time reduction to...
