Mercurial > repo
annotate wisdom/np-complete @ 12241:033de8f65e9c draft
<b_jonas> addwhatis bfi(1hackeso) - no description
author | HackEso <hackeso@esolangs.org> |
---|---|
date | Thu, 05 Dec 2019 22:46:52 +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. |