annotate wisdom/np-complete @ 12274:3c04e9ef7a3a draft

<kspalaiologos> `` cp -rf /hackenv/tmp/asmbf-1.2.7/bin/* /hackenv/lib/kps/
author HackEso <hackeso@esolangs.org>
date Tue, 31 Dec 2019 17:47:30 +0000
parents aa3200667614
children
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
rev   line source
8983
aa3200667614 <oerjan> learn NP-complete is the subset of NP to which all problems in P can be reduced, thus completely solving them.
HackBot
parents:
diff changeset
1 NP-complete is the subset of NP to which all problems in P can be reduced, thus completely solving them.