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

Hacker Newsnew | past | comments | ask | show | jobs | submit

		Old school AI isn't dead: How we achieved a 12× speedup on an NP hard problem (assembled.com)
		28 points by johnjwang 3 months ago \| hide \| past \| favorite \| 6 comments

abtoronto 3 months ago | [–]

This is great!

minhtuev 3 months ago | | [–]

Scheduling is a fun problem

arietty 3 months ago | | [–]

This is fantastic!

tallpauldoll 3 months ago | | [–]

NP =\= P

johnjwang 3 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 3 months ago | | [–]

wow, great breakdown!

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact