view wisdom/np-complete @ 12404:28bc49686b04 draft

<salpynx> ` $(\xf0\x9f\x8c\xb1 2 6) -s \xf0\x9f\x8c\xb1 $HACKENV/bin/seed
author HackEso <hackeso@esolangs.org>
date Thu, 17 Jun 2021 23:51:56 +0100
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.