tailieunhanh - Lecture Design and Analysis of Algorithms: Lecture 44 - Dr. Sohail Aslam

The class NP-complete (NPC) problems consists of a set of decision problems (a subset of class NP) that no one knows how to solve efficiently. But if there were a polynomial solution for even a single NP-complete problem, then ever problem in NPC will be solvable in polynomial time. For this, we need the concept of reductions. In this lecture, you find clear explanations of Reductions. |