view wisdom/np-complete @ 12277:37e5bb140d98 draft

<kspalaiologos> fetch /hackenv/lib/kps/bfpp https://hack.esolangs.org/get/lib/kps/bfpp
author HackEso <hackeso@esolangs.org>
date Tue, 31 Dec 2019 18:29:39 +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.