The NPC complexity class is the class of problems which are NP-Complete. That is, they can all be verified in polynomial time. That means that if you have a problem and are given a possible answer, you can verify whether or not that answer is right or wrong in O(n^k) steps (see Big-oh Notation), as opposed to something like O(n!) steps (see factorial).