Computational complexity theory classifies problems by the amount of resources (time, space, randomness, communication) needed to solve them. " The central classes are P (problems solvable in polynomial time) and NP (problems whose solutions can be verified in polynomial time). The P vs NP question asks whether every problem whose solution can be quickly verified can also be quickly solved.