view wisdom/np-complete @ 11550:4d1ab3124746 draft

<oerjan> slwd vst//s,a ,,
author HackEso <hackeso@esolangs.org>
date Mon, 07 May 2018 01:43:08 +0100
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.