view wisdom/np-complete @ 11970:a11466b41646 draft

<oerjan> slwd hungry//s,edit,eat,
author HackEso <hackeso@esolangs.org>
date Wed, 16 Oct 2019 08:36:03 +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.