Polynomial (Karp's) Reductions provides a way of transforming in polynomial time (and space) and instance from one NP-complete problem into an instance of another NP-complete problem, for example, from 3-SAT to graph 3-COLORING. After submitting a file, and a reduction to be performed, the application will try to perform the request and will show you a hyperlink from with which the reduction can be downloaded. |