NP-hard SAT and CSP problems which admit exponentially improved algorithms | Hacker News Reader