view wisdom/np-complete @ 12261:04048c0ef071 draft

<int-e> sled ../bin/"//s=shuff=shuf=
author HackEso <hackeso@esolangs.org>
date Sat, 07 Dec 2019 23:59:32 +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.