view wisdom/np-complete @ 12018:03d43745ff23 draft

<b_jonas> `` hg cat -r 9075 bin/random-card > bin/random-card
author HackEso <hackeso@esolangs.org>
date Thu, 14 Nov 2019 21:44:59 +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.