view wisdom/np-complete @ 12030:c4f056decced draft

<oerjan> revert
author HackEso <hackeso@esolangs.org>
date Fri, 15 Nov 2019 01:28:18 +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.