view wisdom/np-complete @ 11600:333877d7fe85 draft

<oerjan> sled bin/toroman//s,.XLCDM,DM/XLCDMEE,
author HackEso <hackeso@esolangs.org>
date Tue, 21 Aug 2018 11:00:34 +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.