Q628036

From Wikidata
Jump to: navigation, search

NP(Q628036)

Computational complexity class of decision problems solvable by a non-deterministic Turing machine in polynomial time.
  • NP class
  • nondeterministic polynomial
  • nondeterministic polynomial time
[edit]
Language Label Description Also known as
English
NP
Computational complexity class of decision problems solvable by a non-deterministic Turing machine in polynomial time.
  • NP class
  • nondeterministic polynomial
  • nondeterministic polynomial time

Statements

/m/05dsb
1 reference
0 references
0 references