view wisdom/np-complete @ 11753:30e9da8f43b5 draft

<shachaf> slwd fizzie//s/sneaky //
author HackEso <hackeso@esolangs.org>
date Wed, 13 Mar 2019 01:03:43 +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.