Hacker News new | ask | show | jobs
by coarise 276 days ago
General constraint satisfaction problem is NP-hard.