view wisdom/np-complete @ 12114:9c7bd01f6d39 draft

<fizzie> sled /hackenv/bin/mislearn//s|tmflry/|$HACKENV/tmflry/|
author HackEso <hackeso@esolangs.org>
date Sat, 16 Nov 2019 22:48:35 +0000
parents aa3200667614
children
line wrap: on
line source

NP-complete is the subset of NP to which all problems in P can be reduced, thus completely solving them.