Look up: NP-complete

1. 
   NP-Complete
   A problem type in which any instance of any other NP class problem can be translated to in polynomial time. This means that if a fast algorithm exists for an NP-complete problem, then any problem that is in NP can be solved with the same algorithm.
   Found on http://mitpress.mit.edu/books/FLAOH/cbnh
   
   
2. 
   NP-complete
   (complexity) (NPC, Nondeterministic Polynomial time complete) A set or property of computational decision problems which is a subset of NP (i.e. can be solved by a nondeterministic Turing Machine in polynomial time), with the additional property that it is also NP-hard. Thus a solution for one NP-complete problem would solve all problems in NP. M...
   Found on http://foldoc.org/
   
   
3. 
   NP-complete
   In computational complexity theory, the complexity class `NP-complete`, also known as `NP-C` or `NPC`, is a subset of NP (`non-deterministic polynomial time`); they are the most difficult problems in NP in the sense that a deterministic, polynomial-time solution to `any` NP-complete problem would provide a solution to every other problem in NP (and conversely, if any one of them provably lacks a deterministic polynomial-time solution, none of the...
   Found on http://en.wikipedia.org/wiki/NP-complete
   
   
4. 
   NP-complete
   Problems are divided into two categories: those for which there exists an algorithm to solve it with polynomial time complexity, and those for which there is no such algorithm. We denote the former class of problems by P. There are problems for which no known algorithm exists that solves it in polynomial time, but there is also no proof that no su...
   Found on http://glossary.computing.society.inform