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.

All labels observed (2)

Label Occurrences
NP canonical 6
NP (nondeterministic polynomial time) 1

How this entity was disambiguated

Referenced by (7)

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

Karp reduction complexityClassContext NP
subject linked to: Karp reductions
EXPTIME contrastWith NP (nondeterministic polynomial time)
subject linked to: complexity class EXPTIME
linked to: NP