Return to the np wiki

added 186 characters in body

Source Link

edit approved Feb 5, 2016 at 18:26

32.1k
11
112
187

In computational complexity, NP is the complexity class consisting of problems whose yes instances can be verified in polynomial time. NP stands for 'nondeterministic polynomial time '.

Link

created Feb 5, 2016 at 17:14

Community Bot