P-versus-NP problem/Definition

A famous open problem in complexity theory asking whether any decision problem that can be solved by a nondeterministic algorithm in polynomial time can also be solved deterministically in polynomial time.