Mercurial > repo
annotate wisdom/np-complete @ 12294:abacb968c310 draft
<kspalaiologos> `` rm -f /hackenv/bin/bfi
author | HackEso <hackeso@esolangs.org> |
---|---|
date | Sat, 04 Jan 2020 09:50:24 +0000 |
parents | aa3200667614 |
children |
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. |