view wisdom/np-complete @ 12300:a20d4132c6b4 draft

<oerjan> le/rn_append zemhill//See http://zem.fi/bfjoust/ for more information.
author HackEso <hackeso@esolangs.org>
date Tue, 07 Jan 2020 07:35:11 +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.