算法设计与分析研究生(2).docVIP

NPC The tractable problems can be solved by efficient algorithms which are bounded by some polynomial in size of the input. Its running time is O(P(n)), where P(n) is a polynomial in the size of the input n.. The class of all problems that can be solved by efficient algorithms is denoted by P (for polynomial time). A problem X is called an NP-HARD if every problem in NP is reducible to X A problem X is called NP-complete problem if (1) X belongs to NP, and (2) X is NP-hard. A problem X is an NP-complete problem if (1) X belong to NP , and (2) Y is polynomially reducible to X, for some problem