NP Complete

#Computers
Problems for which a solution cannot be found in polynomial time by a deterministic Turing Machine but can be verified in polynomial time

Topics

• Polynomial-Time Reducible
• Maximum Clique Problem
• Maximum Independent Set Problem
• Boolean Satisfiability Problem
• Vertex Cover Problem
• Subset Problem