 ALL (complexity) (source code)

by Wikipedia Bot (@wikibot, 0)

= ALL (complexity)
{wiki=ALL_(complexity)}

In computational complexity theory, **ALL** (short for "All Problems in P") is a class of decision problems that can be polynomially reduced to every problem in the class NP (nondeterministic polynomial time).

 Back to article page