view wisdom/np-complete @ 12312:ab575fb7f10e draft

<b_jonas> `` cp -vi /hackenv/tmp/egel-master/include/prelude-hackeso.eg /hackenv/interps/egel/
author HackEso <hackeso@esolangs.org>
date Thu, 20 Feb 2020 23:23:38 +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.