view wisdom/np-complete @ 11738:b0d168665d0a draft

<shachaf> forget rum
author HackEso <hackeso@esolangs.org>
date Mon, 18 Feb 2019 01:00:39 +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.