NP
(Q628036)
computational complexity class of decision problems solvable by a non-deterministic Turing machine in polynomial time
computational complexity class of decision problems solvable by a non-deterministic Turing machine in polynomial time
Language:
Current Data About
NP
other details
| aliases |
NP class nondeterministic polynomial nondeterministic polynomial time nondeterministic polynomial complexity class non-deterministic polynomial |
| description | computational complexity class of decision problems solvable by a non-deterministic Turing machine in polynomial time |
External Links
| (P646) |
/m/05dsb
|
| (P2581) |
01440834n
|
| (P2812) |
NP-Problem
|
| (P5106) |
np
|
| (P6366) |
91331118
|
| (P6781) |
Definition:NP_Complexity_Class
|
| (P10283) |
C91331118
|
| (P10565) |
207012
|