view wisdom/np-complete @ 12199:517125a230de draft

<oerjan> complain int-e complains too much
author HackEso <hackeso@esolangs.org>
date Thu, 28 Nov 2019 01:59:56 +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.