view .hg_archival.txt @ 8983:aa3200667614

<oerjan> learn NP-complete is the subset of NP to which all problems in P can be reduced, thus completely solving them.
author HackBot
date Sat, 27 Aug 2016 17:11:01 +0000
parents e037173e0012
children
line wrap: on
line source

repo: 91b847686710739546584c6316a0fb109ba2095c
node: fc8e6b56392fc6ba11e3fab6ea8b4d96ad8bff2d
branch: default
latesttag: null
latesttagdistance: 1602