= P vs NP =

P vs NP is a major unsolved problem in CS.

P is a problem that can be solved quickly, quickly meaning polynomial time.