NP

E1115573 UNEXPLORED

NP (nondeterministic polynomial time) is the complexity class of decision problems for which proposed solutions can be verified in polynomial time by a deterministic Turing machine.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
NP canonical	1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Valiant–Vazirani theorem → relatesClass → NP ⓘ