view wisdom/np-complete @ 12162:8bb3e1600f3c draft

<oerjan> slbd sport//s,$HACKENV,,g
author HackEso <hackeso@esolangs.org>
date Tue, 19 Nov 2019 03:44:32 +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.