view wisdom/np-complete @ 12313:6048b940f5be draft

<oerjan> t ` rm karma.*
author HackEso <hackeso@esolangs.org>
date Fri, 21 Feb 2020 03:16:56 +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.