view wisdom/np-complete @ 11987:20a9de091c24 draft

<kspalaiologos> fetch bin/asmbf https://hack.esolangs.org/get/bin/asmbf
author HackEso <hackeso@esolangs.org>
date Thu, 24 Oct 2019 19:40:25 +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.