Question: what is np in computer science?
Answer: In computational complexity theory, NP (nondeterministic polynomial time) is a complexity class used to classify decision problems. ... An equivalent definition of NP is the set of decision problems solvable in polynomial time by a non-deterministic Turing machine.