> take a long time compiling Lol np-hard is still np-hard no matter how you slic... | Hacker News

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

		almostgotcaught 2 days ago \| parent \| context \| favorite \| on: Show HN: Luminal – Open-source, search-based GPU c... > take a long time compiling Lol np-hard is still np-hard no matter how you slice it (especially given vague objective functions).

jafioti 2 days ago [–]

np-hard is still solveable with constraints. look at go.

gregorygoc 2 days ago | [–]

What about it?

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