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

28 pointsposted 4 months ago
by johnjwang
(assembled.com)

7 Comments

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!