view wisdom/np-complete @ 12129:49a4b4d9f2d7 draft

<fizzie> fetch tmp-interp https://hack.esolangs.org/get/bin/interp
author HackEso <hackeso@esolangs.org>
date Sun, 17 Nov 2019 00:58:53 +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.