view wisdom/np-complete @ 12170:16729e53f493 draft

<oerjan> fetch ../bin/rlexp https://hack.esolangs.org/get/bin/rlexp
author HackEso <hackeso@esolangs.org>
date Wed, 20 Nov 2019 06:22:09 +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.