log wisdom/np-complete @ 12253:ad5c5d1b7d04 draft

age author description
Sat, 27 Aug 2016 17:11:01 +0000 HackBot <oerjan> learn NP-complete is the subset of NP to which all problems in P can be reduced, thus completely solving them.