Old school AI isn't dead: How we achieved a 12× speedup on an NP hard problemassembled.com 28 pointsjohnjwang10 months ago6 commentsSaveHideCopy link On HNComments−abtoronto10moThis is great!−minhtuev10moScheduling is a fun problem−arietty10moThis is fantastic!−tallpauldoll10moNP =\= P−johnjwangOP10moVery 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−joyyun10mowow, great breakdown!
Comments
This is great!
Scheduling is a fun problem
This is fantastic!
NP =\= P
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
wow, great breakdown!