view wisdom/np-complete @ 11602:20868e1dad42 draft

<oerjan> revert
author HackEso <hackeso@esolangs.org>
date Tue, 21 Aug 2018 11:03:25 +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.