Also known as NP class, nondeterministic polynomial, nondeterministic polynomial time, nondeterministic polynomial complexity class, non-deterministic polynomial
computational complexity class of decision problems solvable by a non-deterministic Turing machine in polynomial time
Wikidata facts
- Instance of
- complexity class
- Has part
- NP-intermediate
- Said to be same as
- P
Show 2 more facts
- Stack Exchange tag
- cstheory.stackexchange.com/tags/np
- maintained by WikiProject
- WikiProject Mathematics
via Wikidata · CC0
~17 min read
Encyclopedic overview
Unsolved problem in computer science
P
Excerpted from Wikipedia’s “NP” article, available under the CC BY-SA 4.0 licence.