P-versus-NP problem/Definition

This article contains just a definition and optionally other subpages (such as a list of related articles), but no metadata. Create the metadata page if you want to expand this into a full article.

P-versus-NP problem [r]:

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.