Mercurial > repo
graph
-
<oerjan> learn NP-complete is the subset of NP to which all problems in P can be reduced, thus completely solving them.Sat, 27 Aug 2016 17:11:01 +0000, by HackBot
-
<oerjan> learn P is the complexity class of Problems. They can be solved by reduction to NP.Sat, 27 Aug 2016 16:58:52 +0000, by HackBot
-
<oerjan> learn P is the complexity class of problems. They can be solved by reduction to NP.Sat, 27 Aug 2016 16:58:28 +0000, by HackBot
-
<oerjan> learn Minpoijjikop bfjoustioppl sdardqwcasf uyvjhyb mipjkpmo.Sat, 27 Aug 2016 16:53:56 +0000, by HackBot
-
<oerjan> learn NP is the complexity class of decisions that are No Problem.Sat, 27 Aug 2016 16:50:27 +0000, by HackBot
-
<shachaf> mkx bin/dowg//doag "wisdom/$1"Sat, 27 Aug 2016 03:07:35 +0000, by HackBot