view wisdom/np-complete @ 12341:a6d1bbf49b0c draft

<int-e> mkx ../bin/progress//echo $(($RANDOM%111-5))%
author HackEso <hackeso@esolangs.org>
date Mon, 31 Aug 2020 12:34:07 +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.