Explore relationships

NP (complexity)

In computational complexity theory, NP (nondeterministic polynomial time) is a complexity class used to classify decision problems.

Use + to expand a branch. Click a topic name to open its summary.