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 nondeterministic Turing machine.

What is meant by non-deterministic polynomial time?

Non-deterministic polynomial time (NP) is actually a marker used to point to a set of problems and bounds of the capability of certain types of computing. NP refers to the set of problems that can be solved in polynomial time by a non-deterministic Turing machine.

What is meant by non-deterministic?

Filters. Non-predictive. Referring to the inability to objectively predict an outcome or result of a process due to lack of knowledge of a cause and effect relationship or the inability to know initial conditions.