Skip to content
Better HN
Top
New
Best
Ask
Show
Jobs
Search
⌘K
Old school AI isn't dead: How we achieved a 12× speedup on an NP hard problem
(opens in new tab)
(assembled.com)
28 points
johnjwang
5mo ago
6 comments
Share
Old school AI isn't dead: How we achieved a 12× speedup on an NP hard problem | Better HN
6 comments
default
newest
oldest
abtoronto
5mo ago
This is great!
minhtuev
5mo ago
Scheduling is a fun problem
arietty
5mo ago
This is fantastic!
tallpauldoll
5mo ago
NP =\= P
johnjwang
OP
5mo 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
5mo ago
wow, great breakdown!
j
/
k
navigate · click thread line to collapse