view wisdom/np-complete @ 12035:8676feb7b32d draft

<int-e> sled bin/asmbf//s/lables/labels/
author HackEso <hackeso@esolangs.org>
date Fri, 15 Nov 2019 14:00:16 +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.