Nondeterministic polynomial time, often abbreviated as NP, refers to a class of problems for which a solution can be verified quickly, in polynomial time, by a deterministic algorithm. This means that if you have a potential solution, you can check its correctness efficiently, even if finding that solution might take a long time. In computer science, problems in NP include many important challenges, such as the traveling salesman problem and boolean satisfiability problem. While it is easy to verify a solution, it is not always easy to find one, leading to the famous question of whether P (problems solvable in polynomial time) equals NP.