Skip to content
EntityQ628036· pop 32· linked from 512 articles

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

Show 1 more fact
Sources (3)

via Wikidata · CC0

~17 min read

Article

Unsolved problem in computer science

P

Connections

Categories