view wisdom/np-complete @ 12228:6cb5704166cb draft

<oerjan> revert
author HackEso <hackeso@esolangs.org>
date Wed, 04 Dec 2019 04:32:51 +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.