NP-complete problems are a class of computational problems for which no efficient solution algorithm is known, but if a solution is provided, it can be verified quickly. Solving any NP-complete problem efficiently would imply that all problems in NP can be solved efficiently, a major unsolved question in computer science known as the P vs NP problem.