Old school AI isn't dead: How we achieved a 12× speedup on an NP hard problem

28 points by johnjwang 2 months ago · 7 comments

Reader

abtoronto 2 months ago

This is great!

minhtuev 2 months ago

Scheduling is a fun problem

arietty 2 months ago

This is fantastic!

tallpauldoll 2 months ago

NP =\= P

johnjwangOP 2 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 2 months ago

wow, great breakdown!

Settings