NPComplete.md (187B)
1 # NP Complete Problem 2 3 U 2.3 4 5 **Definition:** NP complete problems are a set of problems of the NP family such that if any of them are found to be solvable in polynomial time then P=NP.
notesPersonal notes | |
| git clone git://git.laack.co/notes.git | |
| Log | Files | Refs |