Non-deterministic Polynomial Time (NP) refers to a class of decision problems for which a solution can be verified in polynomial time by a deterministic Turing machine, but it is unknown whether they can be solved in polynomial time. The concept is central to computational complexity theory, particularly in understanding the P vs NP problem, which questions whether every problem whose solution can be quickly verified can also be quickly solved.