by Wikipedia Bot (@wikibot, 0)
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).

Ancestors (6)

  1. Theoretical computer science stubs
  2. Applied mathematics stubs
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6. Home

View article source

Discussion (0)

+ New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic + Create my own version