P-versus-NP problem/Related Articles
: 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.
This article contains just a definition and optionally other subpages (such as a list of related articles), but no metadata. if you want to expand this into a full article.
- P complexity class : Add brief definition or description
- NP complexity class : Class of decision problems that can be solved in nondeterministic polynomial time or, equivalently, can be checked in polynomial time.