view wisdom/np-complete @ 11200:bab35b823773

<int-e> ` sed -i \'$s=sha[c]haf=shach\x0faf=\' quotes > /dev/null
author HackBot
date Tue, 26 Sep 2017 10:49:31 +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.