view wisdom/np-complete @ 12131:138d7dafc5b1 draft

<fizzie> slbd hello-world-in-any-language//s|hw/|${HACKENV-/hackenv}/hw/|g
author HackEso <hackeso@esolangs.org>
date Sun, 17 Nov 2019 01:26:58 +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.