view wisdom/np-complete @ 11965:5ee76938a218 draft

<rain2> ` echo rain1 >> bin/ioccclist
author HackEso <hackeso@esolangs.org>
date Thu, 10 Oct 2019 07:20:42 +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.