view wisdom/np-complete @ 12192:469e94c792c0 draft

<shachaf> mkx ../bin/brl//url "$HACKENV/bin/$1"
author HackEso <hackeso@esolangs.org>
date Wed, 27 Nov 2019 02:10:14 +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.