view wisdom/np-complete @ 12152:c7cc64c16398 draft

<oerjan> fetch ../bin/lastfiles https://hack.esolangs.org/get/bin/lastfiles
author HackEso <hackeso@esolangs.org>
date Mon, 18 Nov 2019 02:42:33 +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.