NP Complexity posted December 2013
![](http://i.imgur.com/OKpQADW.png)
true mastery of a subject is achieved when you can explain it simplyHere's a stackoverflow pretty simple explanation
A decision problem is in P if there is a known polynomial-time algorithm to get that answer. A decision problem is in NP if there is a known polynomial-time algorithm for a non-deterministic machine to get the answer.
Comments
leave a comment...