view wisdom/np-complete @ 12039:0ab73df2eb49 draft

<kspalaiologos> ` rm bfi
author HackEso <hackeso@esolangs.org>
date Fri, 15 Nov 2019 14:11:44 +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.