view wisdom/np-complete @ 12151:627b52c6b2cb draft

<oerjan> revert
author HackEso <hackeso@esolangs.org>
date Mon, 18 Nov 2019 02:35:04 +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.