top | item 45618254 Old school AI isn't dead: How we achieved a 12× speedup on an NP hard problem 28 points| johnjwang | 4 months ago |assembled.com 6 comments order hn newest abtoronto|4 months ago This is great! minhtuev|4 months ago Scheduling is a fun problem arietty|4 months ago This is fantastic! tallpauldoll|4 months ago NP =\= P johnjwang|4 months ago Very true, and I promise we didn’t solve P vs NP over lunch :). We just got much better at not exploring useless parts of the tree joyyun|4 months ago wow, great breakdown! aebrrrr|4 months ago [deleted]
tallpauldoll|4 months ago NP =\= P johnjwang|4 months ago Very true, and I promise we didn’t solve P vs NP over lunch :). We just got much better at not exploring useless parts of the tree
johnjwang|4 months ago Very true, and I promise we didn’t solve P vs NP over lunch :). We just got much better at not exploring useless parts of the tree
abtoronto|4 months ago
minhtuev|4 months ago
arietty|4 months ago
tallpauldoll|4 months ago
johnjwang|4 months ago
joyyun|4 months ago
aebrrrr|4 months ago
[deleted]