NPProblem.md (192B)
1 # NP Problem 2 3 U 2.3 4 5 **Definition:** An NP problem (non-deterministic polynomial) is a problem that can be verified in polynomial time but is not (believed to be) solvable in polynomial time.
notesPersonal notes | |
| git clone git://git.laack.co/notes.git | |
| Log | Files | Refs |