List of NP-complete problems

NP-complete problems are a class of problems in computational complexity theory that are particularly important because they are both in NP (nondeterministic polynomial time) and as hard as any problem in NP. If any NP-complete problem can be solved in polynomial time, then every problem in NP can also be solved in polynomial time.