view wisdom/np-complete @ 11963:b54cc53510bd draft

<kmc> ` echo $IRC_NICK >> bin/pbflist
author HackEso <hackeso@esolangs.org>
date Thu, 10 Oct 2019 07:09:03 +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.