view wisdom/np-complete @ 12177:7df6e3f0219f draft

<oerjan> slbd `//s,1,@,
author HackEso <hackeso@esolangs.org>
date Thu, 21 Nov 2019 04:39:30 +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.